바로가기메뉴

본문 바로가기 주메뉴 바로가기

ACOMS+ 및 학술지 리포지터리 설명회

  • 한국과학기술정보연구원(KISTI) 서울분원 대회의실(별관 3층)
  • 2024년 07월 03일(수) 13:30
사전등록 바로가기
 

logo

  • P-ISSN1738-3110
  • E-ISSN2093-7717
  • SCOPUS, ESCI

ISSN : 1738-3110

논문 상세

이전 다음
선공개 논문 논문 투고

Vol.10 No.12

Citation Share

Model and Heuristics for the Heterogeneous Fixed Fleet Vehicle Routing Problem with Pick-Up and Delivery

Model and Heuristics for the Heterogeneous Fixed Fleet Vehicle Routing Problem with Pick-Up and Delivery

The Journal of Distribution Science(JDS) / The Journal of Distribution Science, (P)1738-3110; (E)2093-7717
2012, v.10 no.12, pp.19-24
https://doi.org/https://doi.org/10.15722/jds.10.12.201212.19
Zhai, Shuai (SolAsia Research Center, Woosong University)
Mao, Chao (Business School, Hunan University)
Zhai, Shuai, & Mao, Chao. (2012). Model and Heuristics for the Heterogeneous Fixed Fleet Vehicle Routing Problem with Pick-Up and Delivery. The Journal of Distribution Science(JDS), 10(12), 19-24, https://doi.org/https://doi.org/10.15722/jds.10.12.201212.19

Abstract

Purpose - This paper discusses the heterogeneous fixed fleet vehicle routing problem with pick-up and delivery (HFFVRPPD), for vehicles with different capacities, fixed costs, and travel costs. Research Design, data, methodology - This paper made nine assumptions for establishing a mathematical model to describe HFFVRPPD. It established a practical mathematical model, and because of the non-deterministic polynomial-time hard (NP-hard), improved the traditional simulated annealing algorithm and tested a new algorithm using a certain scale model. Result - We calculated the minimum cost of the heterogeneous fixed fleet vehicle routing problem (HFFVRP) with a single task and, on comparing the results with the actual HFFVRP for the single task alone, observed that the total cost of HFFVRPPD reduced significantly by 46.7%. The results showed that the new algorithm provides better solutions and stability. Conclusions - This paper, by comparing the HFFVRP and HFFVRPPD results, highlights certain advantages of using HFFVRPPD in physical distribution enterprises, such as saving distribution vehicles, reducing logistics cost, and raising economic benefits.

keywords
Vehicle Routing Problem, VRP with Pick-Up and Delivering, Simulated Annealing Algorithm, HFFVRP, HFFVRPPD

참고문헌

1.

Angelelli, E. and Mansini, R. (2002), "The Vehicle Routing Problem with Time Windows and Simultaneous Pickup and Delivery", Distribution Logistics and Supply Chain Management, 30(6), 249–267.

2.

Anily, S. (1996), "The Vehicle Routing Problems with Delivery and Back-haul Options", Naval Research Logistics, 17(43), 415-434.

3.

Baldacci, R. & Battara, M. (2007), "Routing a heterogeneous fleet of vehicles", Journal of Transportation Systems Engineering and Information Technology, 12(2), 23-27.

4.

Dantzig, G. and Ramser, J. (1959), "The Truck Dispatching Problem", Management Science, 6 (1): 80-91.

5.

Doris, S., Cristian, E. and Alfredo, N. (2008), "Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering", Computers & Operations Research, 16(35),3412-3438.

6.

Lin, Shih-Wei, Yu, Vincent, F. and Chou, Shuo- Yan. (2009),"Solving the truck and trailer routing problem based on a simulatedannealing heuristic", Computers & OperationsResearch, 36(5), 1683-1692.

7.

Liu, Yun-zhong and Xuan, Hui-yu. (2005), "Summarizing Research on Models and Algorithms for Vehicle Routing Problem", Journal of Industrial Engineering/Engineering Management, 19(1), 124-130.

8.

Taillard, E. (1999), "A heuristic column generation method for the heterogeneous fleet VRP", Ramiro Research Operation, 33(1), 114.

9.

Toth, P. and Vigo, D. (2001), "An overview of vehicle routing problems", Society for Industrial and Applied Mathematics, 36(10), 183-192.

The Journal of Distribution Science(JDS)

선공개 논문 논문 투고 OA 정책