A genetic algorithm for service level based vehicle scheduling
From MaRDI portal
Publication:1268204
DOI10.1016/0377-2217(95)00185-9zbMath0912.90177MaRDI QIDQ1268204
Publication date: 18 October 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00185-9
90B06: Transportation, logistics and supply chain management
90B35: Deterministic scheduling theory in operations research
Related Items
A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms, Quality inspection scheduling for multi-unit service enterprises, An evolutionary algorithm approach to the share of choices problem in the product line design, A new approach to solving the multiple traveling salesperson problem using genetic algorithms, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic vehicle routing: A comprehensive approach
- Stochastic vehicle routing with modified savings algorithm
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- The pickup and delivery problem with time windows
- k-interchange procedures for local search in a precedence-constrained routing problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems
- Bounds and Heuristics for Capacitated Routing Problems
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- A single-server priority queueing-location model
- Accelerated branch exchange heuristics for symmetric traveling salesman problems
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- State-space relaxation procedures for the computation of bounds to routing problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
- On the Distance Constrained Vehicle Routing Problem
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
- Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
- A Vehicle Routing Problem with Stochastic Demand
