earticle

논문검색

Other IT related Technology

Optimizing delivery routing problem for logistics companies based on Integer Linear Programming method

초록

영어

Currently, issues related to freight at Vietnamese logistics companies are becoming more and more urgent because of typical problems in Vietnam such as traffic, infrastructure, and application of information technology. This problem has been studied by applying many different approaches such as Integer Programming (LP), Mixed Integer Programming (MIP), hybrid, meta search, … In this paper, we applied the ILP model in order to deal with the VRP problem in a small size logistics company which is very popular in Vietnam. The experiments showed promising results with some optimal solutions with some small extra costs.

목차

Abstract
1. Introduction
2. Integer Linear Programming Model
3. The proposed Approach
4. Experiment results
4.1. Environment
4.2. Collected data
4.3. Experiment
5. Conclusion
REFERENCES

저자정보

  • Ngoc-Anh Cao University of Economics - Technology for Industries, VNU Information Technology Institute, Vietnam National University in Hanoi
  • Thanh-Hang Phan VNU Information Technology Institute, Vietnam National University in Hanoi
  • Nguyen Thi Chinh VNU Information Technology Institute, Vietnam National University in Hanoi
  • Duc-Quynh Tran VNU International School, Vietnam National University in Hanoi
  • Ha-Nam Nguyen VNU Information Technology Institute, Vietnam National University in Hanoi, Dainam University, Hanoi, Vietnam
  • Ngo-Thi-Thu-Trang Posts and Telecommunications Institute of Technology, Hanoi city, Vietnam
  • Gyoo-Seok Choi Department of Computer Science, Chungwoon University, Incheon, Korea

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.