Article

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

---

A reverse logistics problem, motivated by many real-life applications, is examined where bottles/cans in which products are delivered from a processing depot to customers in one period are available for return to the depot in the following period. The picked-up bottles/cans need to be adjusted in the place of delivery load. This problem is termed as simultaneous delivery and pick-up problem with constrained capacity (SDPC). We develop three unified heuristics based on extended branch and bound heuristic, genetic algorithm and simulated annealing to solve SDPC. These heuristics are also designed to solve standard travelling salesman problem (TSP) and TSP with simultaneous delivery and pick-up (TSDP). We tested the heuristics on standard, derived and randomly generated datasets of TSP, TSDP and SDPC and obtained satisfying results with high convergence in reasonable time.

---

Ketersediaan

Informasi Detail

Judul Seri

International Journal of Systems Science

No. Panggil

ATC LO ANB u

Penerbit

United Kingdom : Taylor and Francis., 2010

Deskripsi Fisik

16 p.

Bahasa

English

ISBN/ISSN

1464–5319

Klasifikasi

LO

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

online resource

Edisi

Vol. 41, No. 3, March 2010, 337–351

Subjek

genetic algorithm
Reverse Logistics
Simulated Annealing
simultaneous delivery and pick-up
constrained capacity
unified heuristics

Info Detail Spesifik

-

Pernyataan Tanggungjawab

S.P. Anbuudayasankar

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar