This chapter discusses Vehicle Routing Problem by finding optimal vehicle routes that visit a set of jobs in a given region. Depending on the situation, a job can be a service provided on‐site, a delivery of goods, or a collection of components. Strongly relying on Coindreau et al. and Gallay and Zuffrey, it describes how car sharing and independent loops (traveled by foot or electric kick scooter) allow for more sustainable transportation activities. To accurately measure the relevance of park‐and‐loop and car sharing, the chapter investigates two intermediate vehicle routing formulations leading to problem and denoted here as (A) and (B). (A) corresponds to the classical VRP situation where each worker has to use her/his single assigned car to move from one job to the other. (B) is a relaxation of (A) where park‐and‐loop is allowed.
A Ruin and Recreate Solution Method for a Lexicographic Vehicle Routing Problem Integrating Park‐and‐Loop and Car Sharing
Solving Transport Problems ; 97-114
2019-12-16
18 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Improving paratransit scheduling using ruin and recreate methods
Online Contents | 2013
|Improving paratransit scheduling using ruin and recreate methods
Taylor & Francis Verlag | 2013
|Integrating Traffic Safety in Vehicle Routing Solution
Springer Verlag | 2017
|Solving the park-and-loop routing problem by branch-price-and-cut
Elsevier | 2023
|Oil shale enables Estonia to recreate farmlands
Tema Archiv | 1994