Capacitated arc routing problem and its extensions in waste collection
Capacitated arc routing problem (CARP) is the youngest generation of graph theory that focuses on solving the edge/arc routing for optimality. Since many years, operational research devoted to CARP counterpart, known as vehicle routing problem (VRP), which does not fit to several real cases such lik...
Main Authors: | Fadzli, Mohammad, Najwa, Nurul, Luis, Martino |
---|---|
Format: | Conference or Workshop Item |
Published: |
2015
|
Subjects: |
Similar Items
-
A guided reactive GRASP for the capacitated multi-source Weber problem
by: Luis, Martino, et al.
Published: (2011) -
Metaheuristics for the waste collection vehicle
routing problem with time windows
by: Benjamin, Aida Mauziah, et al.
Published: (2010) -
Efficient GRASP based heuristics for the capacitated continuous location-allocation problem
by: Luis, Martino, et al.
Published: (2015) -
Rank-based memetic algorithm for capacitated arc routing problems
by: Mittal, Sameer.
Published: (2013) -
Enhanced Heuristic Algorithms with A Vehicle Travel Speed Model for Time-Dependent Vehicle Routing: A Waste Collection Problem
by: Mat, Nur Azriati, et al.
Published: (2018)