Paper Info
Title
The selective Traveling Salesman Problem with emission allocation rules.
Abstract
The paper introduces the selective Traveling Salesman Problem with emission allocation rules (sTSP-EA). This is to select a subset of transport requests from the set of requests given to a carrier, and find a corresponding route such that the transport emission allocatable to one particular request takes a minimum consistent with the emission reporting standard EN 16258. The sTSP-EA is relevant for collaborating shippers who consolidate their shipments and thus need to allocate the total emission caused by a transport process to the shipments moved in the process. A mixed-integer linear optimization model is presented for the problem. Since only small-sized instances can be solved this way, a Large Neighborhood Search heuristic is proposed for the sTSP-EA and tested in a comprehensive computational study.
Year
DOI
Venue
2018
10.1007/s00291-017-0493-z
OR Spectrum
Keywords
Field
DocType
Transport emission calculation, reporting standard EN 16258, selective TSP, pollution routing, Large Neighborhood Search
Heuristic,Mathematical optimization,Economics,Travelling salesman problem,Linear programming,Large neighborhood search
Journal
Volume
Issue
ISSN
40
1
1436-6304
Citations 
PageRank 
References 
1
0.36
7
Authors
2
Name
Order
Citations
PageRank
Thomas Kirschstein1103.62
Christian Bierwirth258638.75