Improving neighborhood exploration into MOEA/D framework to solve a bi-objective routing problem
From MaRDI portal
(Redirected from Publication:6609702)
Cites work
- A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows
- A hybrid algorithm for a class of vehicle routing problems
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A unified solution framework for multi-attribute vehicle routing problems
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Designing granular solution methods for routing problems with time windows
- scientific article; zbMATH DE number 4104743 (Why is no real title available?)
- scientific article; zbMATH DE number 2096871 (Why is no real title available?)
- Knowledge-guided local search for the vehicle routing problem
- Multi-objective combinatorial optimization: problematic and context
- Multi-objective vehicle routing problems
- New benchmark instances for the capacitated vehicle routing problem
- The granular tabu search and its application to the vehicle-routing problem
- Vehicle Routing
Cited in
(1)
This page was built for publication: Improving neighborhood exploration into MOEA/D framework to solve a bi-objective routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609702)