The vehicle-routing problem with delivery and back-haul options
From MaRDI portal
Publication:4883161
DOI<415::AID-NAV7>3.0.CO;2-C 10.1002/(SICI)1520-6750(199604)43:3<415::AID-NAV7>3.0.CO;2-CzbMath0846.90035OpenAlexW2033287538MaRDI QIDQ4883161
Publication date: 3 October 1996
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199604)43:3<415::aid-nav7>3.0.co;2-c
lower boundheuristicvehicle-routingoptimal total costfleet of identical capacitated vehiclesroutes of minimum total length
Related Items
A unified heuristic for a large class of vehicle routing problems with backhauls, Multi-ant colony system (MACS) for a vehicle routing problem with backhauls, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups, CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up, Self-organizing feature maps for the vehicle routing problem with backhauls, An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls, Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery, A Lagrangian relaxation-based heuristic for the vehicle routing with full container load, Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries, Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries, A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
