Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain

DOI10.1080/00207720903326944zbMath1292.90038OpenAlexW1966441798MaRDI QIDQ5494706

K. P. Mohandas, S. C. Lenny Koh, S. P. Anbuudayasankar, K. Ganesh

Publication date: 29 July 2014

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207720903326944

zbMATH Keywords

simulated annealingreverse logisticsgenetic algorithmconstrained capacitysimultaneous delivery and pick-upunified heuristics

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Revisiting revenue management for remanufactured products ⋮ An interactive possibilistic programming approach for a multi-objective closed-loop supply chain network under uncertainty ⋮ Reliability evaluation of a multistate network subject to time constraint under routing policy ⋮ Determine the optimal carrier selection for a logistics network based on multi-commodity reliability criterion

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
• Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
• Reverse logistics: simultaneous design of delivery routes and returns strategies
• CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
• General solutions to the single vehicle routing problem with pickups and deliveries
• Heuristics for the traveling salesman problem with pickup and delivery
• The travelling salesman problem with pick-up and delivery
• The traveling salesman problem with delivery and backhauls
• A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• Using simulated annealing to solve routing and location problems
• An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
• A shortest path algorithm for a nonrotating object among obstacles of arbitrary shapes
• Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up

This page was built for publication: Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain