2013 · 28 citations · 23 references
Natural SciencesIndustrial EngineeringOperations ManagementAlgorithmsOptimizationTransportationCombinatorial OptimizationHeuristic OptimizationHeuristic SearchMetaheuristic OptimizationOptimization Under UncertaintyRobust OptimizationAnt Colony OptimizationHeuristic Routing AlgorithmsMetaheuristic SearchRobust Metaheuristic OptimizationRouting ProblemsTravel CostsVehicle RoutingVehicle Routing Problems
In this study, we consider a capacitated vehicle routing problem where the objective function is to minimize the total travel cost.We also consider that the travel costs between the locations are subject to uncertainty, therefore they are expressed as intervals, rather than fixed numbers. The motivation of this study is to solve this problem by using a metaheuristic approach. We base our approach on a variant of ant colony optimization metaheuristic, called ant colony system, which was originally implemented for solving the deterministic version of the problem (i.e. the classical version of the problem without the uncertainty), previously reported in the literature. We modify the algorithm to incorporate a robust optimization methodology, so that the uncertainty on traveling costs can be handled.
23
George B. Dantzig, J. H. Ramser · Management Science · 1959 · 4.9K citations
Dimitris Bertsimas, Melvyn Sim · Operations Research · 2004 · 4.4K citations
Computer Solutions of the Traveling Salesman Problem
Shen Lin · Bell System Technical Journal · 1965 · 2K citations
Robust discrete optimization and network flows
Dimitris Bertsimas, Melvyn Sim · Mathematical Programming · 2003 · 1.8K citations