• Journal of Korean Institute of Industrial Engineers
• /
• 제39권6호
• /
• pp.554-561
• /
• 2013

As a special topic of the vehicle routing problems (VRP), VRPSDP extends the vehicle routing problem as considering simultaneous pickup and delivery for goods. The past studies have mainly dealt with a only weight constraint of a loading capacity for heterogeneous products. However. this study suggests VRPSDP considering separate loading area according to characteristics of loading species. The objective is to design a set of minimum distance routes for the vehicle routing assignment with independent capacity for heterogeneous species. And then we present a another HVRPSDP model which is easy to utilizes in a unique circumstance that is a guarantee of executing a task simultaneously from the various areas under restricted time and raising an application of vehicles that returns at the depot for the next mission like the military group. The optimal results of the suggested mathematical models are solved by the ILOG CPLEX software ver. 12.4 that is provided by IBM company.

• Journal of Korean Institute of Industrial Engineers
• /
• 제35권2호
• /
• pp.150-159
• /
• 2009

The heterogeneous fleet vehicle routing problem(HVRP) is a variant of the classical vehicle routing problem in which customers are served by a heterogeneous fleet of vehicles with various capacities, fixed costs and variable costs. We propose a new conceptual HVRPCR(HVRP with customer restriction) model including additional customer restrictions in HVRP. In this paper, we develop hybrid particle swarm optimization(HPSO) algorithm with 2-opt and node exchange technique for HVRP. The solution representation is a n-dimensional particle for HVRP with N customers. The decoding method for this representation starts with the transformation of particle into a priority list of customer to enter route and limit of vehicle to serve each customer. The vehicle routes are then constructed based on the customer priority list and limit of vehicle to serve. The proposed algorithm is tested using 8 benchmark problems and it consistently produces high-quality solutions, including new best solutions. The numerical results show that the proposed algorithm is robust and efficient.

• Korean Management Science Review
• /
• 제29권1호
• /
• pp.89-99
• /
• 2012

In this paper, we deal with the dual-depot heterogeneous vehicle routing problem with simultaneous delivery and pick up(DH-VRPSDP) in reverse logistics. The DH-VRPSDP is a problem of designing vehicle routes in a day of given vehicle to minimize the sum of fixed cost and variable cost over the planning horizon. Each customer can be visited only once according to the service combinations of that customer. Due to the complexity of the problem, we suggest a heuristic algorithm in which an initial solution is obtained by changing the customer and the vehicle simultaneously and then it is improved. A performance of the proposed algorithm was compared to both well-known results and new test problems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• 제22권53호
• /
• pp.37-44
• /
• 1999

The problem to be studied here is the minimization of the total travel distance and the number of vehicles used for delivering goods to customers. Vehicle routes must also satisfy a variety of constraints such as fixed vehicle capacity, allowed operating time. Genetic algorithm to solve the VRPTW with heterogeneous fleet is presented. The chromosome of the proposed GA in this study has the 3-dimension. We propose GA that has the cubic-chromosome for VRPTW with heterogeneous fleet. The newly suggested ‘Cubic-GA (or 3-D GA)’ in this paper means the 2-D GA with GLS(Genetic Local Search) algorithms and is quite flexible. To evaluate the performance of the algorithm, we apply it to the Solomon's VRPTW instances. It produces a set of good routes and the reasonable number of vehicles.

• Journal of the Korean Operations Research and Management Science Society
• /
• 제36권1호
• /
• pp.27-38
• /
• 2011

In this paper, we deal with the periodic heterogeneous fleet vehicle routing problem (PHVRP). PHVRP is a problem of designing vehicle routes in each day of given period to minimize the sum of fixed cost and variable cost over the planning horizon. Each customer can be visited once or more times over the planning horizon according to the service combinations of that customer. Due to the complexity of the problem, we suggest a heuristic algorithm in which an initial solution is obtained by assigning the customer-day and the customer-car simultaneously and then it is improved. A performance of the proposed algorithm was compared to both well-known results and new test problems.

• Journal of Distribution Science
• /
• 제10권12호
• /
• pp.19-24
• /
• 2012

Purpose - This paper discusses the heterogeneous fixed fleet vehicle routing problem with pick-up and delivery (HFFVRPPD), for vehicles with different capacities, fixed costs, and travel costs. Research Design, data, methodology - This paper made nine assumptions for establishing a mathematical model to describe HFFVRPPD. It established a practical mathematical model, and because of the non-deterministic polynomial-time hard (NP-hard), improved the traditional simulated annealing algorithm and tested a new algorithm using a certain scale model. Result - We calculated the minimum cost of the heterogeneous fixed fleet vehicle routing problem (HFFVRP) with a single task and, on comparing the results with the actual HFFVRP for the single task alone, observed that the total cost of HFFVRPPD reduced significantly by 46.7%. The results showed that the new algorithm provides better solutions and stability. Conclusions - This paper, by comparing the HFFVRP and HFFVRPPD results, highlights certain advantages of using HFFVRPPD in physical distribution enterprises, such as saving distribution vehicles, reducing logistics cost, and raising economic benefits.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제14권4호
• /
• pp.901-908
• /
• 2010

There are many kinds of networks in vehicle for their purposes. In-vehicle networks, however, are not unified to single network. The networks are composed of several local networks because of communication speed, cost and efficiency. Because the complexity of network design for communication increases, local networks need a framework for interworking between heterogeneous networks. In this paper, a framework interworking between in-vehicle networks for ITS(Intelligent Transportation System) is proposed and implemented. The proposed framework consists of a compatible protocol, message conversion module, message transceiver module and message analysis module. The results obtained by implementation show that the framework efficiently supports the communication of information between heterogeneous in-vehicle networks.

• Journal of Korean Institute of Industrial Engineers
• /
• 제31권3호
• /
• pp.228-239
• /
• 2005

In this paper, we propose a new conceptual HVRPCR(Heterogeneous Fleet Vehicle Routing Problem with Customer Restriction) model including additional restrictions that are consisted of loadage limit and possible visit number of demand post in HVRP. We propose HVRPCR algorithm using the heuristic in order to solve speedily because VRP is NP-Hard and need many solution time. The proposed model is simulated with changing demand post location, demand weight, loading and possible visit number limitation. Results of the computational experiment are provided along with some analysis like travel cost reduction rate.

• Journal of Institute of Control, Robotics and Systems
• /
• 제20권12호
• /
• pp.1181-1188
• /
• 2014

In this paper, we propose a novel concept foran unmanned delivery service using a cooperative heterogeneous unmanned system consisting of a self-driving car and an unmanned aerial vehicle (UAV). The proposed concept is suitable to deliver parcels in high-density and high-rise urban or residential areas. In order to achieve the proposed concept, we will develop acooperative heterogeneous unmanned system. Customers can order goods using a smartphone application and the order information, including the position of the customer and the order time, and the package is transported automatically by the unmanned systems. The system assigns the tasks suitable for each unmanned vehicle by analyzing it based on map information. Performance is validated by experiments consisting of autonomous driving and flight tests in a real environment. For more evaluation, the landing position error analysis is performed using circular error probability (CEP).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국해양정보통신학회 2009년도 추계학술대회
• /
• pp.219-222
• /
• 2009

Recently, as the techniques of vehicle and communication have improve, the techniques of in- vehicle network that is a essential part of ITS have been focused. In-vehicle networks, however, are not unified to single network. The networks are composed of several local networks because of communication speed, cost and efficiency. It is important to communicate information between the networks. Therefore, the complexity of network design for communication increases. To solve this problem, local networks need a framework for interworking between heterogeneous networks. In this paper, a framework interworking between in-vehicle networks is proposed.