Time dependent vehicle routing problem with a multi ant colony system
From MaRDI portal
Publication:2464200
DOI10.1016/j.ejor.2006.06.047zbMath1146.90328OpenAlexW2082878954MaRDI QIDQ2464200
Norman Casagrande, Alberto V. Donati, Roberto Montemanni, Luca Maria Gambardella, Andrea-Emilio Rizzoli
Publication date: 10 December 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.047
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Modified particle swarm optimization in a time-dependent vehicle routing problem: minimizing fuel consumption ⋮ The time-dependent shortest path and vehicle routing problem ⋮ A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine ⋮ Solution of the inverse problem in solidification of binary alloy by applying the ACO algorithm ⋮ Vehicle dispatching for minimizing arrival conflicts in multi-supplier logistics network ⋮ An ant colony system for responsive dynamic vehicle routing ⋮ Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services ⋮ Time-dependent routing problems: a review ⋮ The time-dependent orienteering problem with time windows: a fast ant colony system ⋮ The secure time-dependent vehicle routing problem with uncertain demands ⋮ The time-dependent capacitated profitable tour problem with time windows and precedence constraints ⋮ Ambulance location and relocation problems with time-dependent travel times ⋮ Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem ⋮ Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery ⋮ An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ Exact and anytime approach for solving the time dependent traveling salesman problem with time windows ⋮ Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows ⋮ A bi-criteria moving-target travelling salesman problem under uncertainty ⋮ Integrated optimal scheduling of repair crew and relief vehicle after disaster ⋮ Artificial intelligence techniques: An introduction to their use for modelling environmental systems ⋮ The time-dependent vehicle routing problem with time windows and road-network information ⋮ A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times ⋮ Solving the stochastic time-dependent orienteering problem with time windows ⋮ ACS-TS: Train scheduling using ant colony system ⋮ Combinatorial optimization and green logistics ⋮ Vehicle routing under time-dependent travel times: the impact of congestion avoidance ⋮ Vehicle routing with stochastic time-dependent travel times ⋮ Combinatorial optimization and green logistics ⋮ A hybrid algorithm for time-dependent vehicle routing problem with time windows ⋮ Tabu search for the time-dependent vehicle routing problem with time windows on a road network ⋮ Multi-trip time-dependent vehicle routing problem with time windows ⋮ A way to optimally solve a time-dependent vehicle routing problem with time windows ⋮ A new solution algorithm for improving performance of ant colony optimization ⋮ USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints ⋮ On-orbit servicing: a time-dependent, moving-target traveling salesman problem ⋮ An ABC heuristic for optimizing moveable ambulance station location and vehicle repositioning for the city of São Paulo ⋮ A fast solution method for the time-dependent orienteering problem ⋮ Modelization of time-dependent urban freight problems by using a multiple number of distribution centers
Uses Software
Cites Work
- A branch and bound algorithm for the robust shortest path problem with interval data.
- Vehicle dispatching with time-dependent travel times
- Ant colonies for the quadratic assignment problem
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Ants can colour graphs
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
