Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지
DOI QR코드

DOI QR Code

Multi-objective Optimization of Vehicle Routing with Resource Repositioning

자원 재배치를 위한 차량 경로계획의 다목적 최적화

  • Received : 2021.02.24
  • Accepted : 2021.05.26
  • Published : 2021.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper deals with a vehicle routing problem with resource repositioning (VRPRR) which is a variation of well-known vehicle routing problem with pickup and delivery (VRPPD). VRPRR in which static repositioning of public bikes is a representative case, can be defined as a multi-objective optimization problem aiming at minimizing both transportation cost and the amount of unmet demand. To obtain Pareto sets for the problem, famous multi-objective optimization algorithms such as Strength Pareto Evolutionary Algorithm 2 (SPEA2) can be applied. In addition, a linear combination of two objective functions with weights can be exploited to generate Pareto sets. By varying weight values in the combined single objective function, a set of solutions is created. Experiments accomplished with a standard benchmark problem sets show that Variable Neighborhood Search (VNS) applied to solve a number of single objective function outperforms SPEA2. All generated solutions from SPEA2 are completely dominated by a set of VNS solutions. It seems that local optimization technique inherent in VNS makes it possible to generate near optimal solutions for the single objective function. Also, it shows that trade-off between the number of solutions in Pareto set and the computation time should be considered to obtain good solutions effectively in case of linearly combined single objective function.

Keywords

References

  1. Braysy, O. and Gendreau, M., Vehicle Routing Problem with Time Windows, Part I : Route Construction and Local Search Algorithms, Transportation Science, 2005, Vol. 39, No. 1, pp. 104-118. https://doi.org/10.1287/trsc.1030.0056
  2. Caggiani, L. and Ottomanelli, M., A Dynamic Simulation Based Model for Optimal Fleet Repositioning in Bike-Sharing Systems, Procedia-Social and Behavioral Sciences, 2013, Vol. 87, pp. 203-210. https://doi.org/10.1016/j.sbspro.2013.10.604
  3. Chemla, D., Meunier, F., Calvo, R.W., Bike Sharing Systems : Solving the Static Rebalancing Problem, Discrete Optimization, 2013, Vol. 10, pp. 120-146. https://doi.org/10.1016/j.disopt.2012.11.005
  4. Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T., A Fast and Elitist Multiobjective Genetic Algorithm : NSGA-II, IEEE Transactions on Evolutionary Computation, 2002, Vol. 6, No. 2, pp. 182-197. https://doi.org/10.1109/4235.996017
  5. Gaspero, L.D., Rendl, A., and Urli, T., Constraint-Based Approaches for Balancing Bike Sharing Systems, LNCS, 2013, Vol. 8124, pp. 758-773.
  6. Hernandez-Perez, H. and Solazar-Gonzalez, J., A Branch-and-Cut Algorithm for a Traveling Salesman Problem with Pickup and Delivery, Discrete Applied Mathematics, 2004, Vol. 145, pp. 126-139. https://doi.org/10.1016/j.dam.2003.09.013
  7. Hansen, P., Mladenovic, N., and Perez, J.A.M., Variable Neighborhood Search : Methods and Applications, Annals of Operations Research, 2010, Vol. 175, No. 1, pp. 367-407. https://doi.org/10.1007/s10479-009-0657-6
  8. Konak, A., Coit, D.W., and Smith, A.E., Multi-objective Optimization using Genetic Algorithms : A Tutorial, Reliability Engineering and System Safety, 2006, Vol. 91, pp. 992-1007. https://doi.org/10.1016/j.ress.2005.11.018
  9. Nebro, A.J., Durillo, J.J., Garcia-Nieto, J., Coello, C.A., Luna, F., and Alba, E., SMPSO : A New PSO-based Meta-heuristic for Multi-Objective Optimization, IEEE Symposium on Computational Intelligence in Multi-Criteria Decision Making, 2009, pp. 66-73.
  10. Rainer-Harbach, M., Papazek, P., Raidl, G.R., Hu, B., and Kloimullner, C., A PILOT/VND/GRASP Hybrid for the Static Balancing of Bike Sharing Systems, LNCS, 2013, Vol. 8111, pp. 372-379.
  11. Rainer-Harbach, M., Papazek, P., Hu, B., and Raidl, G.R., Balancing Bicycle Sharing Systems : A Variable Neighborhood Search Approach, LNCS, 2013, Vol. 7832, pp. 121-132.
  12. Raviv, T. and Kolka, O., Optimal Inventory Management of a Bike-Sharing Station, IIE Transactions, 2013, Vol. 45, No. 10, pp. 1077-1093. https://doi.org/10.1080/0740817X.2013.770186
  13. Raviv, T., Tzur, M., and Forma, I.A., Static Repositioning in a Bike-Sharing System : Models and Solution Approaches, EURO Journal on Transportation and Logistics, 2013, Vol. 2, No. 3, pp. 187-229. https://doi.org/10.1007/s13676-012-0017-6
  14. Schuijbroek, J., Hampshire, R., and Hoeve, W., Inventory Rebalancing and Vehicle Routing in Bike Sharing Systems, European Journal of Operations Research, 2013, Vol. 257, No. 3, pp. 992-1004. https://doi.org/10.1016/j.ejor.2016.08.029
  15. Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., and Subramanian, A., New Benchmark Instances for the Capacitated Vehicle Routing Problem, European Journal of Operations Research, 2017, Vol. 257, No. 3, pp. 845-858. https://doi.org/10.1016/j.ejor.2016.08.012
  16. Yim, D.-S., Application of Variable Neighborhood Search Algorithms to a Static Repositioning Problem in Public Bike-Sharing Systems, Journal of Korean Operations Research and Management Science, 2016, Vol. 41, No. 1, pp. 41-53. https://doi.org/10.7737/JKORMS.2016.41.1.041
  17. Zitzler, E. and Thiele, L., Multi-objective Evolutionary Algorithms : A Comparative Case Study and the Strength Pareto Approach, IEEE Trans. Evol. Comput., 1999, Vol. 3, pp. 257-271. https://doi.org/10.1109/4235.797969