• Title/Summary/Keyword: CVRP

Search Result 3, Processing Time 0.017 seconds

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

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