Conflict-free electric vehicle routing problem: an improved compositional algorithm
From MaRDI portal
(Redirected from Publication:6544788)
Recommendations
- A constraint programming approach to electric vehicle routing with time windows
- The location routing problem using electric vehicles with constrained distance
- Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
Cites work
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A note on two problems in connexion with graphs
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- Computing small unsatisfiable cores in satisfiability modulo theories
- Decision procedures. An algorithmic point of view
- Developing Conflict-Free Routes for Automated Guided Vehicles
- Guiding high-performance SAT solvers with unsat-core predictions
- scientific article; zbMATH DE number 6506583 (Why is no real title available?)
- scientific article; zbMATH DE number 1140674 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- Scheduling and routing of automated guided vehicles: A hybrid approach
- Tabu Search—Part I
- The truck dispatching problem
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
This page was built for publication: Conflict-free electric vehicle routing problem: an improved compositional algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6544788)