Conflict-free electric vehicle routing problem: an improved compositional algorithm

DOI10.1007/s10626-023-00388-6zbMATH Open1547.9017MaRDI QIDQ6544788

Knut Åkesson, M. Fabian, Sabino Francesco Roselli

Publication date: 27 May 2024

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

zbMATH Keywords

optimizationschedulingautonomous vehiclesCF-EVRP

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Decision procedures. An algorithmic point of view
• Scheduling and routing of automated guided vehicles: A hybrid approach
• Guiding high-performance SAT solvers with unsat-core predictions
• The Truck Dispatching Problem
• Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Tabu Search—Part I
• Developing Conflict-Free Routes for Automated Guided Vehicles
• A Scalable Algorithm for Minimal Unsatisfiable Core Extraction

This page was built for publication: Conflict-free electric vehicle routing problem: an improved compositional algorithm