• Title/Summary/Keyword: Vehicle Routing

Search Result 214, Processing Time 0.169 seconds

Applying the COMSOAL Heuristic to the Optimal Vehicle Routing Selection (COMSOAL 휴리스틱을 이용한 최적 운송경로 탐색)

  • 이성열
    • Korean Management Science Review
    • /
    • v.20 no.1
    • /
    • pp.141-148
    • /
    • 2003
  • Vehicle routing problem Is known to be a NP-hard problem, and is traditionally solved by some heuristic approaches. This paper investigates the application of the computer method COMSOAL to the optimal vehicle routing problem. This paper discusses the adaptation of the COMSOAL approach to the known set of simple vehicle routing example problem. The results show that the COHSOAL can be a good possible approach to solve the vehicle routing problem.

Combining Vehicle Routing with Forwarding : Extension of the Vehicle Routing Problem by Different Types of Sub-contraction

  • Kopfer, Herbert;Wang, Xin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.35 no.1
    • /
    • pp.1-14
    • /
    • 2009
  • The efficiency of transportation requests fulfillment can be increased through extending the problem of vehicle routing and scheduling by the possibility of subcontracting a part of the requests to external carriers. This problem extension transforms the usual vehicle routing and scheduling problems to the more general integrated operational transportation problems. In this contribution, we analyze the motivation, the chances, the realization, and the challenges of the integrated operational planning and report on experiments for extending the plain Vehicle Routing Problem to a corresponding problem combining vehicle routing and request forwarding by means of different sub-contraction types. The extended problem is formalized as a mixed integer linear programming model and solved by a commercial mathematical programming solver. The computational results show tremendous costs savings even for small problem instances by allowing subcontracting. Additionally, the performed experiments for the operational transportation planning are used for an analysis of the decision on the optimal fleet size for own vehicles and regularly hired vehicles.

A supply planning model based on inventory-allocation and vehicle routing problem with location-assignment (수송경로 문제를 고려한 물류최적화모델의 연구)

  • 황흥석;최철훈;박태원
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1997.10a
    • /
    • pp.201-204
    • /
    • 1997
  • This study is focussed on optimization problems which require allocating the restricted inventory to demand points and assignment of vehicles to routes in order to deliver goods for demand sites with optimal decision. This study investigated an integrated model using three step-by-step approach based on relationship that exists between the inventory allocation and vehicle routing with restricted amount of inventory and transportations. we developed several sub-models such as; first, an inventory-allocation model, second a vehicle-routing model based on clustering and a heuristic algorithms, and last a vehicle routing scheduling model, a TSP-solver, based on genetic algorithm. Also, for each sub-models we have developed computer programs and by a sample run it was known that the proposed model to be a very acceptable model for the inventory-allocation and vehicle routing problems.

  • PDF

A Vehicle Routing Model for Multi-Supply Centers Based on Lp-Distance (일반거리산정방법을 이용한 다-물류센터의 최적 수송경로 계획 모델)

  • Hwang, Heung-Suk
    • IE interfaces
    • /
    • v.11 no.1
    • /
    • pp.85-95
    • /
    • 1998
  • This study is focussed on an optimal vehicle routing model for multi-supply centers in two-echelon logistic system. The aim of this study is to deliver goods for demand sites with optimal decision. This study investigated an integrated model using step-by-step approach based on relationship that exists between the inventory allocation and vehicle routing with restricted amount of inventory and transportations such as the capability of supply centers, vehicle capacity and transportation parameters. Three sub-models are developed: 1) sector-clustering model, 2) a vehicle-routing model based on clustering and a heuristic algorithm, and 3) a vehicle route scheduling model using TSP-solver based on genetic and branch-and-bound algorithm. Also, we have developed computer programs for each sub-models and user interface with visualization for major inputs and outputs. The application and superior performance of the proposed model are demonstrated by several sample runs for the inventory-allocation and vehicle routing problems.

  • PDF

Heuristics for Rich Vehicle Routing Problem : A Case of a Korean Mixed Feed Company (다특성 차량경로문제에 대한 휴리스틱 알고리즘 : 국내 복합사료 업체 사례)

  • Son, Dong Hoon;Kim, Hwa-Joong
    • Journal of the Society of Korea Industrial and Systems Engineering
    • /
    • v.42 no.1
    • /
    • pp.8-20
    • /
    • 2019
  • The vehicle routing problem is one of the vibrant research problems for half a century. Many studies have extensively studied the vehicle routing problem in order to deal with practical decision-making issues in logistics. However, developments of new logistics strategies have inevitably required investigations on solution methods for solving the problem because of computational complexity and inherent constraints in the problem. For this reason, this paper suggests a simulated annealing (SA) algorithm for a variant of vehicle routing problem introduced by a previous study. The vehicle routing problem is a multi-depot and multi-trip vehicle routing problem with multiple heterogeneous vehicles restricted by the maximum permitted weight and the number of compartments. The SA algorithm generates an initial solution through a greedy-type algorithm and improves it using an enhanced SA procedure with three local search methods. A series of computational experiments are performed to evaluate the performance of the heuristic and several managerial findings are further discussed through scenario analyses. Experiment results show that the proposed SA algorithm can obtain good solutions within a reasonable computation time and scenario analyses show that a transportation system visiting non-dedicated factories shows better performance in truck management in terms of the numbers of vehicles used and trips for serving customer orders than another system visiting only dedicated factories.

A Survey on the Real Time Vehicle Routing Problems (실시간 차량 경로 계획 문제의 연구 동향)

  • Yang, Byoung-Hak
    • Journal of the Korea Safety Management & Science
    • /
    • v.10 no.1
    • /
    • pp.155-166
    • /
    • 2008
  • During last two decades the transportation system has developed into very intelligent system with GIS, GPS and ITS. The practical transportation management system provides real time response module to manage the customer's order. We have surveyed research papers on the real time vehicle routing problem in last two decades to figure out the dynamic vehicle routing problem. The papers are classified by basic routing algorithms and by managing the dynamic events which are the order management, the routing re-optimization, the routing post-optimization and the waiting strategy.

공급 사슬 상에서 Cross Docking을 고려한 Vehicle Routing Scheduling(VRS)

  • 이경민;이영해
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.11a
    • /
    • pp.325-328
    • /
    • 2003
  • Fierce competition in today's global markets, the heightened expectation of customers have forced business enterprises to invest in, and focus attentions on, their Supply Chains, Also Cross Docking is an essential part of SC, and integrating Cross Docking with vehicle routing scheduling is needed to smoothly link the physical flow of SC, However, there is no the mathematical model which focuses on Cross Docking with vehicle routing scheduling. Therefore, the integrating model considers Cross Docking and vehicle routing scheduling will be developed in this paper. And the solution based on Tabu algorithm to this model will be provided.

  • PDF

Realtime Multiple Vehicle Routing Problem using Self-Organization Map (자기조작화 신경망을 이용한 복수차량의 실시간 경로계획)

  • 이종태;장재진
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.4
    • /
    • pp.97-109
    • /
    • 2000
  • This work proposes a neural network approach to solve vehicle routing problems which have diverse application areas such as vehicle routing and robot programming. In solving these problems, classical mathematical approaches have many difficulties. In particular, it is almost impossible to implement a real-time vehicle routing with multiple vehicles. Recently, many researchers proposed methods to overcome the limitation by adopting heuristic algorithms, genetic algorithms, neural network techniques and others. The most basic model for path planning is the Travelling Salesman Problem(TSP) for a minimum distance path. We extend this for a problem with dynamic upcoming of new positions with multiple vehicles. In this paper, we propose an algorithm based on SOM(Self-Organization Map) to obtain a sub-optimal solution for a real-time vehicle routing problem. We develope a model of a generalized multiple TSP and suggest and efficient solving procedure.

  • PDF

Optimal Vehicle Routing Selection Using COMSOAL (COMSOAL을 이용한 최적 운송경로 선정)

  • Lee Seong Yeol
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.193-196
    • /
    • 2002
  • Vehicle routing problem is known to be a NP-hard problem, and is traditionally solved by some heuristic approaches. This paper investigates the application of the computer method COMSOAL to the optimal vehicle routing selection problem. The COMSOAL (Computer Method of Sequencing Operations for Assembly Lines) is a computer heuristic originally developed to solve an assembly line balancing problem a few decades ago. The solution methodology of repeatedly running COMSOAL will result in many feasible solutions from which the best is chosen. This solution approach now becomes viable thanks to the significantly increased speed of recent computer technology. This paper discusses the adaptation of the COMSOAL approach to the known set of simple vehicle routing example problem. The results show that the COMSOAL can be a good possible approach to solve the vehicle routing problem.

  • PDF

Study on the Guided Tabu Search for the Vehicle Routing Problem (차량경로 문제에 대한 Guided Tabu 검색)

  • Lee, Seung-Woo;Lee, Hwa-Ki
    • Journal of the Korea Safety Management & Science
    • /
    • v.10 no.1
    • /
    • pp.145-153
    • /
    • 2008
  • The vehicle routing problem determines each vehicle routes to find the transportation costs, subject to meeting the customer demands of all delivery points in geography. Vehicle routing problem is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study aims to develop a heuristic method which combines guided local search with a tabu search in order to minimize the transportation costs for the vehicle routing assignment and uses ILOG programming library to solve. The computational tests were performed using the benchmark problems. And computational experiments on these instances show that the proposed heuristic yields better results than the simple tabu search does.