earticle

논문검색

A Multi Objective Approach to solve Capacitated Vehicle Routing Problems with Time Windows Using Mixed Integer Linear Programming

원문정보

Jose Carlos Sousa, Haider Ali Biswas, Rui Brito, Alexandre Silveira

보안공학연구지원센터(IJAST) International Journal of Advanced Science and Technology vol.28 2011.03 pp.1-8
피인용수 : 0건 (자료제공 : 네이버학술정보)

초록

영어

This paper presents a multi objective approach to solve a Capacitated Vehicle Routing Problem ith Time Windows (CVRPTW). The proposed model was implemented and tested in a real life roblem of a distribution company “Just in Time Delivery S.A” in Portugal. In this paper we ave considered an objective function with two main goals: the first is to minimize the total number f vehicles used in the distribution of the commodities to the several clients and the second is to inimize the travelling time of the used vehicles. The proposed model has been solved numerically sing the GLPK software and the optimal solution is presented.

목차

Abstract
 1. Introduction
 2. Mathematical Analysis and Problem Formulation
  2.1 Problem Formulation:
 3. Computational Tests and Results
  3.1 Sensibility Analyzes: vehicle capacity
  3.2 Sensibility Analyzes: time window of clients 6
 4. Conclusion
 References

키워드

저자정보

  • José Carlos Sousa Department of Electrical and Computer Engineering, Faculty of Engineering, University of Porto, Rua Dr. Roberto
  • Haider Ali Biswas Department of Electrical and Computer Engineering, Faculty of Engineering, University of Porto, Rua Dr. Roberto
  • Rui Brito bDepartment of Electrical Engineering, ISEP, Portugal.
  • Alexandre Silveira Department of Electrical Engineering, ISEP, Portugal.

참고문헌

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

    함께 이용한 논문

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

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