Application of Adapt-CMSA to the two-echelon electric vehicle routing problem with simultaneous pickup and deliveries

DOI10.1007/978-3-031-30035-6_2OpenAlexW4361861587MaRDI QIDQ6149084

Mehmet Anıl Akbay, Christian Blum, Can Berk Kalayci

Publication date: 12 January 2024

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30035-6_2

zbMATH Keywords

two-echelonsimultaneous pickup and deliveryEVRP

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
• The savings algorithm for the vehicle routing problem
• The electric two-echelon vehicle routing problem
• The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
• Two-echelon vehicle routing problems: a literature review
• A review of vehicle routing with simultaneous pickup and delivery
• The Truck Dispatching Problem
• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up

This page was built for publication: Application of Adapt-CMSA to the two-echelon electric vehicle routing problem with simultaneous pickup and deliveries