The selective traveling salesman problem with emission allocation rules

DOI10.1007/s00291-017-0493-zzbMath1397.90414OpenAlexW2765207281MaRDI QIDQ1703461

Thomas Kirschstein, Christian Bierwirth

Publication date: 2 March 2018

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-017-0493-z

zbMATH Keywords

large neighborhood searchpollution routingreporting standard EN 16258selective TSPtransport emission calculation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)

Related Items (1)

Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: the pollution routing game

Uses Software

• VRP

Cites Work

• Unnamed Item
• A review of recent research on green road freight transportation
• A comparison of programming languages in macroeconomics
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer Programming Formulation of Traveling Salesman Problems
• On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem

This page was built for publication: The selective traveling salesman problem with emission allocation rules