Finding the trade-off between emissions and disturbance in an urban context

We introduce the bi-objective emissions disturbance traveling salesman problem (BEDTSP), which aims at minimizing carbon dioxide emissions ($$\hbox {CO}_2$$CO2) as well as disturbance to urban neighborhoods, when planning the tour of a single vehicle delivering goods to customers. Although there exist recent studies on minimizing emissions, we are not aware of any work on minimizing disturbance. We develop four different mathematical models for the BEDTSP. We also develop several data generation strategies for minimizing disturbance. These strategies consider optional nodes, thus allowing detours that yield less disturbance but also possibly more emissions. All models and strategies are compared in an extensive computational study. Experimental results allow us to derive clear guidelines for which model and data generation strategy to use in which context. Following these guidelines, we conduct a case study for the city of Vienna.

[1]  Horst W. Hamacher,et al.  Finding representative systems for discrete bicriterion optimization problems , 2007, Oper. Res. Lett..

[2]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[3]  Franklin Farell Roadmap to a Single European Transport Area: Towards a competitive and resource efficient transport system , 2014 .

[4]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[5]  Richard F. Hartl,et al.  The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations , 2013, Eur. J. Oper. Res..

[6]  Gilbert Laporte,et al.  The bi-objective Pollution-Routing Problem , 2014, Eur. J. Oper. Res..

[7]  A. Palmer The development of an integrated routing and carbon dioxide emissions model for goods vehicles , 2007 .

[8]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[9]  Gilbert Laporte,et al.  The time-dependent pollution-routing problem , 2013 .

[10]  Sophie N. Parragh,et al.  Investing in logistics facilities today to reduce routing emissions tomorrow , 2017 .

[11]  Daniele Vigo,et al.  The Hybrid Electric Vehicle - Traveling Salesman Problem , 2016, Eur. J. Oper. Res..

[12]  Xavier Gandibleux,et al.  A survey and annotated bibliography of multiobjective combinatorial optimization , 2000, OR Spectr..

[13]  Martin W. P. Savelsbergh,et al.  A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method , 2015, INFORMS J. Comput..

[14]  T. V. Woensel,et al.  A selected review on the negative externalities of the freight transportation: Modeling and pricing , 2015 .

[15]  M. Hansen,et al.  Evaluating the quality of approximations to the non-dominated set , 1998 .

[16]  Kanok Boriboonsomsin,et al.  Energy and emissions impacts of a freeway-based dynamic eco-driving system , 2009 .

[17]  Michel Gendreau,et al.  A tabu search heuristic for the undirected selective travelling salesman problem , 1998, Eur. J. Oper. Res..

[18]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[19]  Yoshinori Suzuki,et al.  A new truck-routing approach for reducing fuel consumption and pollutants emission , 2011 .

[20]  Richard F. Hartl,et al.  Heuristics for the multi-period orienteering problem with multiple time windows , 2010, Comput. Oper. Res..

[21]  Yoshinori Suzuki,et al.  A dual-objective metaheuristic approach to solve practical pollution routing problem , 2016 .

[22]  Guido Perboli,et al.  The multi-path Traveling Salesman Problem with stochastic travel costs , 2017, EURO J. Transp. Logist..

[23]  Xavier Gandibleux,et al.  Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function , 2006, 4OR.

[24]  E. Martins On a multicriteria shortest path problem , 1984 .

[25]  Gilbert Laporte,et al.  The Pollution-Routing Problem , 2011 .

[26]  Bahar Yetis Kara,et al.  Energy Minimizing Vehicle Routing Problem , 2007, COCOA.

[27]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[28]  Christian Artigues,et al.  Vehicle routing problems with alternative paths: An application to on-demand transportation , 2010, Eur. J. Oper. Res..

[29]  Paolo Serafini,et al.  Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems , 1987 .

[30]  Roberto Roberti,et al.  The Electric Traveling Salesman Problem with Time Windows , 2016 .

[31]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[32]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[33]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[34]  Yacov Y. Haimes,et al.  Multiobjective Decision Making: Theory and Methodology , 1983 .