Heuristic algorithms for a multi-period multi-stop transportation planning problem

Cited 11 time in webofscience Cited 0 time in scopus
  • Hit : 620
  • Download : 46
We consider a multi-period multi-stop transportation planning problem (MPMSTP) in a one-warehouse multi-retailer distribution system where a fleet of homogeneous vehicles delivers products from a warehouse to retailers. The objective of the MPMSTP is to minimize the total transportation distance for product delivery over the planning horizon while satisfying demands of the retailers. We suggest two heuristic algorithms based on the column generation method and the simulated annealing algorithm. Computational experiments on randomly generated test problems showed that the suggested algorithms gave better solutions than an algorithm currently used in practice and algorithms modified from existing algorithms for vehicle routing problems.
Publisher
PALGRAVE PUBLISHERS LTD
Issue Date
2002-09
Language
English
Article Type
Article
Keywords

VEHICLE-ROUTING COSTS; DISTRIBUTION-SYSTEMS; INVENTORY ALLOCATION; WAREHOUSE; SHIPMENTS; OPTIMIZATION; FREQUENCIES; PRODUCTS

Citation

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.53, no.9, pp.1027 - 1037

ISSN
0160-5682
URI
http://hdl.handle.net/10203/7760
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 11 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0