scientific article; zbMATH DE number 3643061
From MaRDI portal
Publication:3048611
zbMATH Open0413.90075MaRDI QIDQ3048611FDOQ3048611
Authors: Aristide Mingozzi, Paolo Toth, Nicos Christofides
Publication date: 1979
Title of this publication is not available (Why is that?)
combinatorial optimizationvehicle routingheuristic algorithmsset partitioning problemcomputational comparisonexact tree search algorithms
Cited In (only showing first 100 items - show all)
- Vehicle Routing Problems and Container Terminal Operations – An Update of Research
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- The split delivery capacitated team orienteering problem
- Routing problems with loading constraints
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- A threshold accepting approach to the Open Vehicle Routing problem
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- A tabu search algorithm for the open vehicle routing problem
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- A tabu search method for the truck and trailer routing problem
- Defining tabu list size and aspiration criterion within tabu search methods
- Location-routing: issues, models and methods
- A general heuristic for vehicle routing problems
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
- Solving the truck and trailer routing problem based on a simulated annealing heuristic
- The vehicle routing problem: An overview of exact and approximate algorithms
- Designing delivery districts for the vehicle routing problem with stochastic demands
- Planning models for freight transportation
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- A hybrid algorithm for a class of vehicle routing problems
- Heuristic solutions to multi-depot location-routing problems
- Vehicle routing with compartments: applications, modelling and heuristics
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Exact algorithms for routing problems under vehicle capacity constraints
- A column generation approach for the split delivery vehicle routing problem
- The \(k\)-dissimilar vehicle routing problem
- Adaptive memory programming for the vehicle routing problem with multiple trips
- A GA based heuristic for the vehicle routing problem with multiple trips
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- An adaptive memory algorithm for the split delivery vehicle routing problem
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
- An ILP improvement procedure for the open vehicle routing problem
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
- A branch and bound algorithm for the capacitated vehicle routing problem
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
- Large neighborhood search for multi-trip vehicle routing
- The latency location-routing problem
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
- Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
- Disrupted capacitated vehicle routing problem with order release delay
- The capacitated team orienteering problem with incomplete service
- A matheuristic for the truck and trailer routing problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A variable neighbourhood search algorithm for the open vehicle routing problem
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- Combination of geographical information system and efficient routing algorithms for real life distribution operations.
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
- Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism
- A memetic algorithm for the multi trip vehicle routing problem
- A unified solution framework for multi-attribute vehicle routing problems
- Recent advances in vehicle routing exact algorithms
- A new ILP-based refinement heuristic for vehicle routing problems
- The undirected capacitated arc routing problem with profits
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- Vehicle routing problems with multiple trips
- Ejection chain and filter-and-fan methods in combinatorial optimization
- The savings algorithm for the vehicle routing problem
- A hierarchical algorithm for the planar single-facility location routing problem
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem
- A heuristic algorithm for the truckload and less-than-truckload problem
- A library of local search heuristics for the vehicle routing problem
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
- Routing problems: A bibliography
- An exact solution framework for a broad class of vehicle routing problems
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- An effective PSO-inspired algorithm for the team orienteering problem
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
- Operations research at container terminals: a literature update
- Separating capacity constraints in the CVRP using tabu search
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
- Combined location-routing problems -- a neural network approach
- Dispatching of small containers via coastal freight liners: The case of the Aegean sea.
- Parallel solution methods for vehicle routing problems
- Topological design of telecommunication networks --- local access design methods
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Probabilistic diversification and intensification in local search for vehicle routing
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Extensions to the generalised assignment heuristic for vehicle routing
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- Heuristics for the lexicographic Max-ordering vehicle routing problem
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
- A visual interactive approach to vehicle routing
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Algorithms and codes for dense assignment problems: The state of the art
- Very large-scale vehicle routing: new test problems, algorithms, and results
- The split delivery vehicle routing problem with three-dimensional loading constraints
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem
- A survey of variants and extensions of the location-routing problem
- On the shortest path problem with negative cost cycles
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations
- Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
- Strong coalitional structure in an open vehicle routing game
- An iterated tabu search for the multi-compartment vehicle routing problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3048611)