du.sePublikasjoner
Endre søk
Link to record
Permanent link

Direct link
BETA
Publikasjoner (10 av 18) Visa alla publikasjoner
Carling, K., Håkansson, J., Meng, X. & Rudholm, N. (2017). The effect on CO2 emissions of taxing truck distance in retail transports. Transportation Research Part A: Policy and Practice, 97, 47-54
Åpne denne publikasjonen i ny fane eller vindu >>The effect on CO2 emissions of taxing truck distance in retail transports
2017 (engelsk)Inngår i: Transportation Research Part A: Policy and Practice, ISSN 0965-8564, E-ISSN 1879-2375, Vol. 97, s. 47-54Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

To finance transportation infrastructure and to address social and environmental negative externalities of road transports, several countries have recently introduced or consider a distance based tax on trucks. In competitive retail and transportation markets, such tax can be expected to lower the demand and thereby reduce CO2 emissions of road transports. However, as we show in this paper, such tax might also slow down the transition towards e-tailing. Considering that previous research indicates that a consumer switching from brick-and-mortar shopping to e-tailing reduces her CO2 emissions substantially, the direction and magnitude of the environmental net effect of the tax is unclear. In this paper, we assess the net effect in a Swedish regional retail market where the tax not yet is in place. We predict the net effect on CO2 emissions to be positive, but off-set by about 50% because of a slower transition to e-tailing.

sted, utgiver, år, opplag, sider
Elsevier, 2017
Emneord
Spatial distribution of e-tailing and consumers; CO2 emissions measurement; online retailing; environmental taxes; carbon footprint; road network
HSV kategori
Forskningsprogram
Komplexa system - mikrodataanalys, Allmänt Mikrodataaanalys - transporter; Komplexa system - mikrodataanalys, Allmänt Mikrodataaanalys - handel
Identifikatorer
urn:nbn:se:du-23917 (URN)10.1016/j.tra.2017.01.010 (DOI)000395612300004 ()
Forskningsfinansiär
Swedish Retail and Wholesale Development Council
Tilgjengelig fra: 2017-01-11 Laget: 2017-01-11 Sist oppdatert: 2017-11-15bibliografisk kontrollert
Carling, K. & Meng, X. (2016). On statistical bounds of heuristic solutions to location problems. Journal of combinatorial optimization, 31(4), 1518-1549
Åpne denne publikasjonen i ny fane eller vindu >>On statistical bounds of heuristic solutions to location problems
2016 (engelsk)Inngår i: Journal of combinatorial optimization, ISSN 1382-6905, E-ISSN 1573-2886, Vol. 31, nr 4, s. 1518-1549Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

Solutions to combinatorial optimization problems, such as problems of locating facilities, frequently rely on heuristics to minimize the objective function. The optimum is sought iteratively and a criterion is needed to decide when the procedure (almost) attains it. Pre-setting the number of iterations dominates in OR applications, which implies that the quality of the solution cannot be ascertained. A small, almost dormant, branch of the literature suggests using statistical principles to estimate the minimum and its bounds as a tool to decide upon stopping and evaluating the quality of the solution. In this paper we examine the functioning of statistical bounds obtained from four different estimators by using simulated annealing on p-median test problems taken from Beasley’s OR-library. We find the Weibull estimator and the 2nd order Jackknife estimator preferable and the requirement of sample size to be about 10 being much less than the current recommendation. However, reliable statistical bounds are found to depend critically on a sample of heuristic solutions of high quality and we give a simple statistic useful for checking the quality. We end the paper with an illustration on using statistical bounds in a problem of locating some 70 distribution centers of the Swedish Post in one Swedish region.

Emneord
p-median problem;simulated annealing; jack-knife; discrete optimization; extreme value theory
HSV kategori
Forskningsprogram
Komplexa system - mikrodataanalys, Allmänt Mikrodataaanalys - metod
Identifikatorer
urn:nbn:se:du-16828 (URN)10.1007/s10878-015-9839-0 (DOI)000373574300012 ()
Tilgjengelig fra: 2015-02-09 Laget: 2015-02-09 Sist oppdatert: 2017-12-04bibliografisk kontrollert
Meng, X. & Rebreyend, P. (2016). On transforming a road network database to a graph for localization purpose. International Journal of Web Services Research, 13(2), 46-55
Åpne denne publikasjonen i ny fane eller vindu >>On transforming a road network database to a graph for localization purpose
2016 (engelsk)Inngår i: International Journal of Web Services Research, ISSN 1545-7362, E-ISSN 1546-5004, Vol. 13, nr 2, s. 46-55Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

The problems of finding best facility locations require complete and accurate road networks with the corresponding population data in a specific area. However the data obtained from road network databases usually do not fit in this usage. In this paper we propose a procedure of converting the road network database to a road graph which could be used for localization problems. Several challenging problems exist in the transformation process which are commonly met also in other data bases. The procedure of dealing with those challenges are proposed. The data come from the National road data base in Sweden. The graph derived is cleaned, and reduced to a suitable level for localization problems. The residential points are also processed in ordered to match the graph. The reduction of the graph is done maintaining the accuracy of distance measures in the network.

Emneord
road network, graph, population, GIS
HSV kategori
Forskningsprogram
Komplexa system - mikrodataanalys
Identifikatorer
urn:nbn:se:du-17361 (URN)10.4018/IJWSR.2016040103 (DOI)000384810100004 ()
Tilgjengelig fra: 2015-05-07 Laget: 2015-05-07 Sist oppdatert: 2017-12-04bibliografisk kontrollert
Carling, K. & Meng, X. (2015). Confidence in heuristic solutions?. Journal of Global Optimization, 63(2), 381-399
Åpne denne publikasjonen i ny fane eller vindu >>Confidence in heuristic solutions?
2015 (engelsk)Inngår i: Journal of Global Optimization, ISSN 0925-5001, E-ISSN 1573-2916, Vol. 63, nr 2, s. 381-399Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

Solutions to combinatorial optimization problems frequently rely on heuristics to minimize an objective function. The optimum is sought iteratively and pre-setting the number of iterations dominates in operations research applications, which implies that the quality of the solution cannot be ascertained. Deterministic bounds offer a mean of ascertaining the quality, but such bounds are available for only a limited number of heuristics and the length of the interval may be difficult to control in an application. A small, almost dormant, branch of the literature suggests using statistical principles to derive statistical bounds for the optimum. We discuss alternative approaches to derive statistical bounds. We also assess their performance by testing them on 40 test p-median problems on facility location, taken from Beasley’s OR-library, for which the optimum is known. We consider three popular heuristics for solving such location problems; simulated annealing, vertex substitution, and Lagrangian relaxation where only the last offers deterministic bounds. Moreover, we illustrate statistical bounds in the location of 71 regional delivery points of the Swedish Post. We find statistical bounds reliable and much more efficient than deterministic bounds provided that the heuristic solutions are sampled close to the optimum. Statistical bounds are also found computationally affordable.

Emneord
p-median problem, deterministic bounds, statistical bounds, jackknife, discrete optimization, extreme value theory
HSV kategori
Forskningsprogram
Komplexa system - mikrodataanalys, Allmänt Mikrodataaanalys - metod
Identifikatorer
urn:nbn:se:du-17153 (URN)10.1007/s10898-015-0293-4 (DOI)000361485700009 ()
Tilgjengelig fra: 2015-03-17 Laget: 2015-03-17 Sist oppdatert: 2017-12-04bibliografisk kontrollert
Carling, K., Han, M., Håkansson, J., Meng, X. & Rudholm, N. (2015). Measuring transport related CO2 emissions induced by online and brick-and-mortar retailing. Transportation Research Part D: Transport and Environment, 40, 28-42
Åpne denne publikasjonen i ny fane eller vindu >>Measuring transport related CO2 emissions induced by online and brick-and-mortar retailing
Vise andre…
2015 (engelsk)Inngår i: Transportation Research Part D: Transport and Environment, ISSN 1361-9209, E-ISSN 1879-2340, Vol. 40, s. 28-42Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

We develop a method for empirically measuring the difference in transport related carbon footprint between traditional and online retailing (“e-tailing”) from entry point to a geographical area to consumer residence. The method only requires data on the locations of brick-and-mortar stores, online delivery points, and residences of the region’s population, and on the goods transportation networks in the studied region. Such data are readily available in most countries. The method has been evaluated using data from the Dalecarlia region in Sweden, and is shown to be robust to all assumptions made. In our empirical example, the results indicate that the average distance from consumer residence to a brick-and-mortar retailer is 48.54 km in the studied region, while the average distance to an online delivery point is 6.7 km. The results also indicate that e-tailing increases the average distance traveled from the regional entry point to the delivery point from 47.15 km for a brick-and-mortar store to 122.75 km for the online delivery points. However, as professional carriers transport the products in bulk to stores or online delivery points, which is more efficient than consumers’ transporting the products to their residences, the results indicate that consumers switching from traditional to e-tailing on average reduce their transport CO2 footprints by 84% when buying standard consumer electronics products. 

Emneord
E-tailing; Spatial distribution of firms and consumers; p-median model; Emission measurement; Emission reduction
HSV kategori
Forskningsprogram
Komplexa system - mikrodataanalys, Allmänt Mikrodataaanalys - transporter; Komplexa system - mikrodataanalys, Allmänt Mikrodataaanalys - handel
Identifikatorer
urn:nbn:se:du-18930 (URN)10.1016/j.trd.2015.07.010 (DOI)000364896200003 ()
Tilgjengelig fra: 2015-07-28 Laget: 2015-07-28 Sist oppdatert: 2019-08-26bibliografisk kontrollert
Meng, X. (2015). Optimization heuristic solutions, how good can they be?: With empirical applications in location problems. (Doctoral dissertation). Borlänge: Dalarna University
Åpne denne publikasjonen i ny fane eller vindu >>Optimization heuristic solutions, how good can they be?: With empirical applications in location problems
2015 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)
Abstract [en]

Combinatorial optimization problems, are one of the most important types of problems in operational research. Heuristic and metaheuristics algorithms are widely applied to find a good solution. However, a common problem is that these algorithms do not guarantee that the solution will coincide with the optimum and, hence, many solutions to real world OR-problems are afflicted with an uncertainty about the quality of the solution. The main aim of this thesis is to investigate the usability of statistical bounds to evaluate the quality of heuristic solutions applied to large combinatorial problems. The contributions of this thesis are both methodological and empirical. From a methodological point of view, the usefulness of statistical bounds on p-median problems is thoroughly investigated. The statistical bounds have good performance in providing informative quality assessment under appropriate parameter settings. Also, they outperform the commonly used Lagrangian bounds. It is demonstrated that the statistical bounds are shown to be comparable with the deterministic bounds in quadratic assignment problems. As to empirical research, environment pollution has become a worldwide problem, and transportation can cause a great amount of pollution. A new method for calculating and comparing the CO2-emissions of online and brick-and-mortar retailing is proposed. It leads to the conclusion that online retailing has significantly lesser CO2-emissions. Another problem is that the Swedish regional division is under revision and the border effect to public service accessibility is concerned of both residents and politicians. After analysis, it is shown that borders hinder the optimal location of public services and consequently the highest achievable economic and social utility may not be attained.

Abstract [sv]

Kombinatoriska optimeringsproblem, är en av de viktigaste typerna av problem i operationsanalys (OR). Heuristiska och metaheuristiska algoritmer tillämpas allmänt för att hitta lösningar med hög kvalitet. Ett vanligt problem är dock att dessa algoritmer inte garanterar optimala lösningar och sålunda kan det finnas osäkerhet i kvaliteten på lösningar på tillämpade operationsanalytiska problem. Huvudsyftet med denna avhandling är att undersöka användbarheten av statistiska konfidensintervall för att utvärdera kvaliteten på heuristiska lösningar då de tillämpas på stora kombinatoriska optimeringsproblem. Bidragen från denna avhandling är både metodologiska och empiriska. Ur metodologisk synvinkel har nyttan av statistiska konfidensintervall för ett lokaliseringsproblem (p-median problemet) undersökts. Statistiska konfidensintervall fungerar väl för att tillhandahålla information om lösningens kvalitet vid rätt implementering av problemen. Statistiska konfidensintervall överträffar även intervallen som erhålls vid den vanligen använda Lagrange-relaxation. I avhandlingen visas även på att metoden med statistiska konfidensintervall är fungerar väl jämfört med många andra deterministiska intervall i ett mer komplexa optimeringsproblem som det kvadratiska tilldelningsproblemet. P-median problemet och de statistiska konfidensintervallen har implementerats empiriskt för att beräkna och jämföra e-handelns och traditionell handels CO2-utsläpp från transporter, vilken visar att ehandel medför betydligt mindre CO2-utsläpp. Ett annat lokaliseringsproblem som analyserats empiriskt är hur förändringar av den regionala administrativa indelningen av Sverige, vilket är en aktuell och pågående samhällsdiskussion, påverkar medborgarnas tillgänglighet till offentlig service. Analysen visar att regionala administrativa iv gränserna lett till en suboptimal placering av offentliga tjänster. Därmed finns en risk att den samhällsekonomiska nyttan av dessa tjänster är suboptimerad.

sted, utgiver, år, opplag, sider
Borlänge: Dalarna University, 2015. s. 200
Serie
Dalarna Doctoral Dissertations ; 2
HSV kategori
Forskningsprogram
Komplexa system - mikrodataanalys
Identifikatorer
urn:nbn:se:du-17353 (URN)978-91-89020-94-8 (ISBN)
Disputas
2015-04-23, Clas Ohlson, Borlänge, 10:00 (engelsk)
Opponent
Veileder
Tilgjengelig fra: 2015-05-07 Laget: 2015-05-06 Sist oppdatert: 2020-01-10bibliografisk kontrollert
Meng, X. (2015). Statistical bound of genetic solutions to quadratic assignment problems. Borlänge: Högskolan Dalarna
Åpne denne publikasjonen i ny fane eller vindu >>Statistical bound of genetic solutions to quadratic assignment problems
2015 (engelsk)Rapport (Annet vitenskapelig)
Abstract [en]

Quadratic assignment problems (QAPs) are commonly solved by heuristic methods, where the optimum is sought iteratively. Heuristics are known to provide good solutions but the quality of the solutions, i.e., the confidence interval of the solution is unknown. This paper uses statistical optimum estimation techniques (SOETs) to assess the quality of Genetic algorithm solutions for QAPs. We examine the functioning of different SOETs regarding biasness, coverage rate and length of interval, and then we compare the SOET lower bound with deterministic ones. The commonly used deterministic bounds are confined to only a few algorithms. We show that, the Jackknife estimators have better performance than Weibull estimators, and when the number of heuristic solutions is as large as 100, higher order JK-estimators perform better than lower order ones. Compared with the deterministic bounds, the SOET lower bound performs significantly better than most deterministic lower bounds and is comparable with the best deterministic ones. 

sted, utgiver, år, opplag, sider
Borlänge: Högskolan Dalarna, 2015. s. 20
Serie
Working papers in transport, tourism, information technology and microdata analysis, ISSN 1650-5581 ; 2015:02
Emneord
quadratic assignment problem, genetic algorithm, Jack-knife, discrete optimization, extreme value theory
HSV kategori
Forskningsprogram
Komplexa system - mikrodataanalys
Identifikatorer
urn:nbn:se:du-17034 (URN)
Tilgjengelig fra: 2015-03-02 Laget: 2015-03-02 Sist oppdatert: 2018-01-11bibliografisk kontrollert
Carling, K., Håkansson, J., Meng, X. & Rudholm, N. (2015). The effects of taxing truck distance on CO2 emissions from transports in retailing.
Åpne denne publikasjonen i ny fane eller vindu >>The effects of taxing truck distance on CO2 emissions from transports in retailing
2015 (engelsk)Rapport (Annet vitenskapelig)
Abstract [en]

To finance transportation infrastructure and to address social and environmental negative externalities of road transports, several countries have recently introduced or consider a distance based tax on trucks. In the competitive retail market such tax can be expected to lower the demand and thereby reduce CO2 emissions of road transports. However, as we show in this paper, such tax might also slow down the transition towards e-tailing. Considering that previous research indicates that a consumer switching from brick-and-mortar shopping to e-tailing reduces her CO2 emissions substantially, the direction and magnitude of the environmental net effect of the tax is unclear. In this paper, we assess the net effect in a Swedish regional retail market where the tax not yet is in place. We predict the net effect on CO2 emissions to be positive, but off-set by about 50% because of a slower transition to e-tailing.

Publisher
s. 14
Serie
Working papers in transport, tourism, information technology and microdata analysis, ISSN 1650-5581 ; 2015:07
Emneord
Spatial distribution of e-tailing and consumers; CO2 emissions measurement; online retailing; environmental taxes; carbon footprint; road network
HSV kategori
Forskningsprogram
Komplexa system - mikrodataanalys, Allmänt Mikrodataaanalys - transporter; Komplexa system - mikrodataanalys, Allmänt Mikrodataaanalys - handel
Identifikatorer
urn:nbn:se:du-17860 (URN)
Tilgjengelig fra: 2015-06-12 Laget: 2015-06-12 Sist oppdatert: 2015-07-01bibliografisk kontrollert
Carling, K. & Meng, X. (2014). Confidence in heuristic solutions?. Borlänge: Högskolan Dalarna
Åpne denne publikasjonen i ny fane eller vindu >>Confidence in heuristic solutions?
2014 (engelsk)Rapport (Annet vitenskapelig)
Abstract [en]

Solutions to combinatorial optimization problems frequently rely on heuristics to minimize an objective function. The optimum is sought iteratively and pre-setting the number of iterations dominates in operations research applications, which implies that the quality of the solution cannot be ascertained. Deterministic bounds offer a mean of ascertaining the quality, but such bounds are available for only a limited number of heuristics and the length of the interval may be difficult to control in an application. A small, almost dormant, branch of the literature suggests using statistical principles to derive statistical bounds for the optimum. We discuss alternative approaches to derive statistical bounds. We also assess their performance by testing them on 40 test p-median problems on facility location, taken from Beasley’s OR-library, for which the optimum is known. We consider three popular heuristics for solving such location problems; simulated annealing, vertex substitution, and Lagrangian relaxation where only the last offers deterministic bounds. Moreover, we illustrate statistical bounds in the location of 71 regional delivery points of the Swedish Post. We find statistical bounds reliable and much more efficient than deterministic bounds provided that the heuristic solutions are sampled close to the optimum. Statistical bounds are also found computationally affordable.

sted, utgiver, år, opplag, sider
Borlänge: Högskolan Dalarna, 2014. s. 26
Serie
Working papers in transport, tourism, information technology and microdata analysis, ISSN 1650-5581 ; 2014:12
HSV kategori
Forskningsprogram
Komplexa system - mikrodataanalys
Identifikatorer
urn:nbn:se:du-14457 (URN)
Tilgjengelig fra: 2014-06-23 Laget: 2014-06-23 Sist oppdatert: 2015-05-07bibliografisk kontrollert
Meng, X. & Rebreyend, P. (2014). From the road network database to a graph for localization purposes. Borlänge: Högskolan Dalarna
Åpne denne publikasjonen i ny fane eller vindu >>From the road network database to a graph for localization purposes
2014 (engelsk)Rapport (Annet vitenskapelig)
Abstract [en]

The problems of finding best facility locations require complete and accurate road network with the corresponding population data in a specific area. However the data obtained in road network databases usually do not fit in this usage. In this paper we propose our procedure of converting the road network database to a road graph which could be used in localization problems. The road network data come from the National road data base in Sweden. The graph derived is cleaned, and reduced to a suitable level for localization problems. The population points are also processed in ordered to match with that graph. The reduction of the graph is done maintaining most of the accuracy for distance measures in the network.

sted, utgiver, år, opplag, sider
Borlänge: Högskolan Dalarna, 2014
Serie
Working papers in transport, tourism, information technology and microdata analysis, ISSN 1650-5581 ; 2014:09
Emneord
road network, graph, population, GIS
HSV kategori
Forskningsprogram
Komplexa system - mikrodataanalys
Identifikatorer
urn:nbn:se:du-14066 (URN)
Tilgjengelig fra: 2014-05-05 Laget: 2014-05-05 Sist oppdatert: 2018-01-11bibliografisk kontrollert
Organisasjoner
Identifikatorer
ORCID-id: ORCID iD iconorcid.org/0000-0003-2970-9622