Small and large neighborhood search for the park-and-loop routing problem with parking selection

DOI10.1016/j.ejor.2023.01.007MaRDI QIDQ6112711

Théo Le Colleter, Fabien Lehuédé, Olivier Péton, Dorian Dumez

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

routinglarge neighborhood searchlast-mile deliverypark-and-loop

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (2)

Admission and pricing optimization of on-street parking with delivery bays ⋮ A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group

Cites Work

• Unnamed Item
• Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
• A survey on two-echelon routing problems
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
• A unified heuristic for a large class of vehicle routing problems with backhauls
• A general heuristic for vehicle routing problems
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
• A two-phase algorithm for the partial accessibility constrained vehicle routing problem
• Record breaking optimization results using the ruin and recreate principle
• Two-echelon vehicle routing problems: a literature review
• The doubly open park-and-loop routing problem
• Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: a review
• Vehicle routing with transportable resources: using carpooling and walking for on-site services
• Solution of real-world postman problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: Small and large neighborhood search for the park-and-loop routing problem with parking selection