Ant colony system for a VRP with multiple time windows and multiple visits

Favaretto, Daniela; Moretti, E.; Pellegrini, Paola

doi:10.1080/09720502.2007.10700491

Cited by 77 publications

(32 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, Favaretto et al [8] extend the VRPTW to allow multiple disjoint time windows for each customer. Pellegrini et al [17] also consider multiple time windows and heterogeneous resources.…”

Section: Classical Routing Problemsmentioning

confidence: 99%

An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations

Murray

Karwan

2010

Naval Research Logistics

View full text Add to dashboard Cite

Unmanned aerial vehicles (UAVs), increasingly vital to the success of military operations, operate in a complex and dynamic environment, sometimes in concert with manned aircraft. We present an extensible modeling framework for the solution to the dynamic resource management (DRM) problem, where airborne resources must be reassigned to time-sensitive tasks in response to changes in battlespace conditions. The DRM problem is characterized by diverse tasks with time windows, heterogeneous resources with fuel-and payload-capacity limitations, and multiple competing objectives. We propose an integer linear programing formulation for this problem, where mathematical feasibility is guaranteed. Although motivated by airborne military operations, the proposed general modeling framework is applicable to a wide array of settings, such as disaster relief operations. Additionally, land-or water-based operations may be modeled within this framework, as well as any combination of manned and unmanned vehicles.

show abstract

Section: Classical Routing Problemsmentioning

confidence: 99%

An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations

Murray

Karwan

2010

Naval Research Logistics

View full text Add to dashboard Cite

show abstract

“…Due to the complexity of the problem, metaheuristics are often used for analyzing and solving practical sized instances of this problem [20,16,17]. In this section, the construction procedure of the Ant Colony System algorithm is adapted to solve the VRPTW by considering the design structure and the constraints of this problem.…”

Section: An Ant Colony System Model For the Vrptwmentioning

confidence: 99%

Exchange strategies for multiple Ant Colony System

Ellabib

Calamai

Basir

2007

Information Sciences

123

View full text Add to dashboard Cite

“…Ant colony optimization is a well-known metaheuristic for combinatorial optimization problems. An ant colony system based algorithm was proposed by Favaretto et al [12] to solve VRP with multiple time window constraints. Yu et al recommended an improved ACO, which implements a new ant-weight strategy to update the increasing trail pheromone and a mutation operation to solve VRP [13].…”

Section: Introductionmentioning

confidence: 99%

Novel Encoding and Routing Balance Insertion Based Particle Swarm Optimization with Application to Optimal CVRP Depot Location Determination

Chen

Shen

2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

A depot location has a significant effect on the transportation cost in vehicle routing problems. This study proposes a hierarchical particle swarm optimization (PSO) including inner and outer layers to obtain the best location to establish a depot and the corresponding optimal vehicle routes using the determined depot location. The inner layer PSO is applied to obtain optimal vehicle routes while the outer layer PSO is to acquire the depot location. A novel particle encoding is suggested for the inner layer PSO, the novel PSO encoding facilitates solving the customer assignment and the visiting order determination simultaneously to greatly lower processing efforts and hence reduce the computation complexity. Meanwhile, a routing balance insertion (RBI) local search is designed to improve the solution quality. The RBI local search moves the nearest customer from the longest route to the shortest route to reduce the travel distance. Vehicle routing problems from an operation research library were tested and an average of 16% total routing distance improvement between having and not having planned the optimal depot locations is obtained. A real world case for finding the new plant location was also conducted and significantly reduced the cost by about 29%.

show abstract

Ant colony system for a VRP with multiple time windows and multiple visits

Cited by 77 publications

References 8 publications

An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations

An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations

Exchange strategies for multiple Ant Colony System

Novel Encoding and Routing Balance Insertion Based Particle Swarm Optimization with Application to Optimal CVRP Depot Location Determination

Contact Info

Product

Resources

About