• Title/Summary/Keyword: Capacitated Vehicle Routing

Search Result 9, Processing Time 0.026 seconds

A Voronoi Tabu Search Algorithm for the Capacitated Vehicle Routing Problem (차량경로 문제에 관한 보로노이 다이어그램 기반 타부서치 알고리듬)

  • Kwon, Yong-Ju;Kim, Jun-Gyu;Seo, Jeongyeon;Lee, Dong-Ho;Kim, Deok-Soo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.33 no.4
    • /
    • pp.469-479
    • /
    • 2007
  • This paper focuses on the capacitated vehicle routing problem that determines the routes of vehicles in such a way that each customer must be visited exactly once by one vehicle starting and terminating at the depot while the vehicle capacity and the travel time constraints must be satisfied. The objective is to minimize the total traveling cost. Due to the complexity of the problem, we suggest a tabu search algorithm that combines the features of the existing search heuristics. In particular, our algorithm incorporates the neighborhood reduction method using the proximity information of the Voronoi diagram corresponding to each problem instance. To show the performance of the Voronoi tabu search algorithm suggested in this paper, computational experiments are done on the benchmark problems and the test results are reported.

The Bisection Seed Detection Heuristic for Solving the Capacitated Vehicle Routing Problem (한정 용량 차량 경로 탐색 문제에서 이분 시드 검출 법에 의한 발견적 해법)

  • Ko, Jun-Taek;Yu, Young-Hoon;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.15 no.1
    • /
    • pp.1-14
    • /
    • 2009
  • The Capacitated Vehicle Routing Problem (CVRP) is the problem that the vehicles stationed at central depot are to be optimally routed to supply customers with demands, satisfying vehicle capacity constraints. The CVRP is the NP-hard as it is a natural generalization of the Traveling Salesman Problem (TSP). In this article, we propose the heuristic algorithm, called the bisection seed detection method, to solve the CVRP. The algorithm is composed of 3-phases. In the first phase, we work out the initial cluster using the improved sweep algorithm. In the next phase, we choose a seed node in each initial cluster by using the bisection seed detection method, and we compose the rout with the nearest node from each seed. At this phase, we compute the regret value to decide the list of priorities for the node assignment. In the final phase, we improve the route result by using the tabu search and exchange algorithm. We compared our heuristic with different heuristics such as the Clark-Wright heuristic and the genetic algorithm. The result of proposed heuristic show that our algorithm can get the nearest optimal value within the shortest execution time comparatively.

  • PDF

A Two-phase Method for the Vehicle Routing Problems with Time Windows (시간대 제약이 있는 차량경로 결정문제를 위한 2단계 해법의 개발)

  • Hong, Sung-Chul;Park, Yang-Byung
    • IE interfaces
    • /
    • v.17 no.spc
    • /
    • pp.103-110
    • /
    • 2004
  • This paper presents a two-phase method for the vehicle routing problems with time windows(VRPTW). In a supply chain management(SCM) environment, timely distribution is very important problem faced by most industries. The VRPTW is associated with SCM for each customer to be constrained the time of service. In the VRPTW, the objective is to design the least total travel time routes for a fleet of identical capacitated vehicles to service geographically scattered customers with pre-specified service time windows. The proposed approach is based on ant colony optimization(ACO) and improvement heuristic. In the first phase, an insertion based ACO is introduced for the route construction and its solutions is improved by an iterative random local search in the second phase. Experimental results show that the proposed two-phase method obtains very good solutions with respect to total travel time minimization.

Decision Problems for the Design and Operations of Sludge Collection System (하수 슬러지 수거 시스템의 설계 및 운영방안에 대한 연구)

  • Choi, Gyung-Hyun;Kwak, Ho-Mahn;Yu, Young-Sun;Cho, Joong-Mou
    • IE interfaces
    • /
    • v.20 no.1
    • /
    • pp.58-68
    • /
    • 2007
  • This research deals with a vehicle scheduling problem for the sludge collection strategies which might be solved via quantitative analysis and cost evaluations schemes. This problem can be modeled as a kind of capacitated vehicle routing pick-up problems. With the aim of establishing operation schedule of vehicles and analyzing the total cost under considering various assumptions and realistic restrictions of the sludge collection problem, we propose a heuristic method based on the genetic algorithm in conjunction with the sweep algorithm and the 4-opt algorithm. Finally, we present the cost effective operation schedule that can be used as the managing tool for the sludge treatment plant of the multi-purpose dam.

Heuristic for Vehicle Routing Problem with Perishable Product Delivery (식품 배송의 특성을 고려한 차량경로문제의 발견적 해법)

  • Kang, Kyung Hwan;Lee, Young Hoon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.33 no.2
    • /
    • pp.265-272
    • /
    • 2007
  • The purpose of Vehicle Routing Problem (VRP) is to design the least costly (distance, time) routes for a fleet of identically capacitated vehicles to serve geographically scattered customers. There may be some restrictions such as the maximal capacity for each vehicle, maximal distance for each vehicle, time window to visit the specific customers, and so forth. This paper is concerned with VRP to minimize the sum of elapsed time from departure, where the elapsed time is defined as the time taken in a moving vehicle from the depot to each customer. It is important to control the time taken from departure in the delivery of perishable products or foods, whose freshness may deteriorate during the delivery time. An integer linear programming formulation is suggested and a heuristic for practical use is constructed. The heuristic is based on the set partitioning problem whose performances are compared with those of ILOG dispatcher. It is shown that the suggested heuristic gave good solutions within a short computation time by computational experiments.

An algorithm for multiple Salesmen problems (다중 경로 탐색 알고리즘)

  • Song, Chi-Hwa;Lee, Won-Don
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.05a
    • /
    • pp.317-320
    • /
    • 2003
  • 본 논문에서는 각 도시마다 가중치가 있는 City domain을 tour하기 위한 문제를 해결하기 위해 Simulated Annealing Algorithm을 확장한 알고리즘을 제시하였고 Capacitated vehicle routing problem을 변형한 Augmented multiple salesman traveling problem을 정의하고 이를 해결하기 위한 에너지 함수와 알고리즘을 제시하였다.

  • PDF

Agent-based Shipment Algorithm for Capacitated Vehicle Routing Problem with Load Balancing (CVRP를 위한 에이전트 기반 Shipment 알고리듬 개발)

  • Oh, Seog-Chan;Yee, Shang-Tae;Kim, Taioun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.32 no.3
    • /
    • pp.200-209
    • /
    • 2006
  • Load building is an important step to make the delivery supply chain efficient. We present a family of load makeup algorithms using market based control strategy, named LoadMarket, in order to build efficient loads where each load consists of a certain number of finished products having destinations. LoadMarket adopts Clark-Wright algorithm for generating initial endowment for Load Traders who cooperate to minimize either total travel distance or the variance with respect to the travel distances of loads by means of the spot market or double-sided auction market mechanism. The efficiency of the LoadMarket algorithms is illustrated using simulation based experiments.

SIMULATION OF RETURNABLE TRANSPORT ITEM SYSTEMS

  • Krabs, Andreas;Reinholz, Andreas
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2001.10a
    • /
    • pp.83-89
    • /
    • 2001
  • This paper provides a short description of the COMPASS-model which is a concept for the simulation of multiway systems. The focus of the COMPASS-model is to offer an opportunity to investigate the effects of redistribution strategies on logistic and monetary values in a system of returnable transport items (RTI). The modeling concept consists of five modules: topology, system load, distribution, redistribution, cost. It includes the integration of highly sophisticated evolutionary algorithms for the optimal solving of complex capacitated vehicle routing problems (CVRP) which are typical for RTI-systems. The results of first experiments with a COMPASS-based prototype are repeated. They reveal some basic regularities in RTI-systems.

  • PDF

Development of Intelligent ATP System Using Genetic Algorithm (유전 알고리듬을 적용한 지능형 ATP 시스템 개발)

  • Kim, Tai-Young
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.4
    • /
    • pp.131-145
    • /
    • 2010
  • The framework for making a coordinated decision for large-scale facilities has become an important issue in supply chain(SC) management research. The competitive business environment requires companies to continuously search for the ways to achieve high efficiency and lower operational costs. In the areas of production/distribution planning, many researchers and practitioners have developedand evaluated the deterministic models to coordinate important and interrelated logistic decisions such as capacity management, inventory allocation, and vehicle routing. They initially have investigated the various process of SC separately and later become more interested in such problems encompassing the whole SC system. The accurate quotation of ATP(Available-To-Promise) plays a very important role in enhancing customer satisfaction and fill rate maximization. The complexity for intelligent manufacturing system, which includes all the linkages among procurement, production, and distribution, makes the accurate quotation of ATP be a quite difficult job. In addition to, many researchers assumed ATP model with integer time. However, in industry practices, integer times are very rare and the model developed using integer times is therefore approximating the real system. Various alternative models for an ATP system with time lags have been developed and evaluated. In most cases, these models have assumed that the time lags are integer multiples of a unit time grid. However, integer time lags are very rare in practices, and therefore models developed using integer time lags only approximate real systems. The differences occurring by this approximation frequently result in significant accuracy degradations. To introduce the ATP model with time lags, we first introduce the dynamic production function. Hackman and Leachman's dynamic production function in initiated research directly related to the topic of this paper. They propose a modeling framework for a system with non-integer time lags and show how to apply the framework to a variety of systems including continues time series, manufacturing resource planning and critical path method. Their formulation requires no additional variables or constraints and is capable of representing real world systems more accurately. Previously, to cope with non-integer time lags, they usually model a concerned system either by rounding lags to the nearest integers or by subdividing the time grid to make the lags become integer multiples of the grid. But each approach has a critical weakness: the first approach underestimates, potentially leading to infeasibilities or overestimates lead times, potentially resulting in excessive work-inprocesses. The second approach drastically inflates the problem size. We consider an optimized ATP system with non-integer time lag in supply chain management. We focus on a worldwide headquarter, distribution centers, and manufacturing facilities are globally networked. We develop a mixed integer programming(MIP) model for ATP process, which has the definition of required data flow. The illustrative ATP module shows the proposed system is largely affected inSCM. The system we are concerned is composed of a multiple production facility with multiple products, multiple distribution centers and multiple customers. For the system, we consider an ATP scheduling and capacity allocationproblem. In this study, we proposed the model for the ATP system in SCM using the dynamic production function considering the non-integer time lags. The model is developed under the framework suitable for the non-integer lags and, therefore, is more accurate than the models we usually encounter. We developed intelligent ATP System for this model using genetic algorithm. We focus on a capacitated production planning and capacity allocation problem, develop a mixed integer programming model, and propose an efficient heuristic procedure using an evolutionary system to solve it efficiently. This method makes it possible for the population to reach the approximate solution easily. Moreover, we designed and utilized a representation scheme that allows the proposed models to represent real variables. The proposed regeneration procedures, which evaluate each infeasible chromosome, makes the solutions converge to the optimum quickly.