Skip to main content

Multi-Criteria Fuel Distribution: A Case Study

  • Conference paper
Artificial Intelligence and Soft Computing (ICAISC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9120))

Included in the following conference series:

  • 1890 Accesses

Abstract

In this paper a multi-criteria fuel distribution problem similar to the common CVRP is considered with the real-life coordinates of gas stations obtained from a certain petrol company. The optimized criteria are the total distance of all tours and the number of tours. A certain method of solution representation, which ensures a feasible solution was used along a decoding scheme. A simulated annealing (SA) metaheuristic algorithm was implemented in order to obtain the approximations of the Pareto set for a number of instances with varying number of gas stations and demands for each station. The results show 17–18% improvement over the starting solution in all cases for both criteria. Moreover, the number of found solutions per instance increases with the number of gas stations. The improvements can be translated directly into profit, which was shown as well.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bowerman, R., Hall, B., Calamai, P.: A multi-objective optimization approach to urban school bus routing: Formulation and solution method. Transportation Research (29), pp. 107–123 (1995)

    Google Scholar 

  2. Bożejko, W., Pempera, J., Smutnicki, C.: Parallel Simulated Annealing for the Job Shop Scheduling Problem. In: Allen, G., Nabrzyski, J., Seidel, E., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2009, Part I. LNCS, vol. 5544, pp. 631–640. Springer, Heidelberg (2009)

    Google Scholar 

  3. Corberan, A., Fernandez, E., Laguna, M., Marti, R.: Heuristic solutions to the problem of routing school buses with multiple objectives. Journal of Operational Research Society (53), 427–435 (2002)

    Google Scholar 

  4. Jagiełło, S., Żelazny, D.: Solving Multi-criteria Vehicle Routing Problem by Parallel Tabu Search on GPU. Procedia Computer Science (18), 2529–2532 (2013)

    Google Scholar 

  5. Keller, C.: Multiobjective routing through space and time: The MVP and TDVRP problems, Ph.D. thesis, University of Western Ontario (1985)

    Google Scholar 

  6. Keller, C., Goodchild, M.: The multiobjective vending problem: A generalization of the traveling salesman problem. Environment and Planning B: Planning and Design (15), 447–460 (1988)

    Google Scholar 

  7. Lee, T.-R., Ueng, J.-H.: A study of vehicle routing problem with load balancing, International Journal of Physical Distribution and Logistics Management (29), 646–657 (1998)

    Google Scholar 

  8. Pacheco, J., Marti, R.: Tabu search for a multi-objective routing problem. Journal of Operational Research Society (57), 29–37 (2006)

    Google Scholar 

  9. Paquete, T.S.L., Chiarandini, L.: Pareto local optimum sets in the bi-objective traveling salesman problem: An experimental study. In: Lecture Notes in Economics and Mathematical Systems, pp. 177–200 (2004)

    Google Scholar 

  10. Pempera, J., Smutnicki, C., Żelazny, D.: Optimizing bicriteria flow shop scheduling problem by simulated annealing algorithm. Procedia Computer Science (18), 936–945 (2013)

    Google Scholar 

  11. Ralphs, T.K., Kopman, L., Pulleyblank, W.R., Trotter Jr., L.E.: On the Capacitated Vehicle Routing Problem. Mathematical Programming (94), 343–359 (2003)

    Google Scholar 

  12. Rudy, J., Żelazny, D.: Memetic algorithm approach for multi-criteria network scheduling. In: Proceeding of the International Conference on ICT Management for Global Competitiveness and Economic Growth in Emerging Economies (ICTM 2012), pp. 247–261 (2012)

    Google Scholar 

  13. Rudy, J., Żelazny, D.: GACO: A parallel evolutionary approach to multi-objective scheduling. In: Gaspar-Cunha, A., Henggeler Antunes, C., Coello, C.C. (eds.) EMO 2015. LNCS, vol. 9018, pp. 307–320. Springer, Heidelberg (2015)

    Google Scholar 

  14. Ulungu, E., Teghem, J., Fortemps, P., Tuyttens, D.: Mosa method: A tool for solving moco problems. Journal of Multi-Criteria Decision Analysis (8), 221–236 (1999)

    Google Scholar 

  15. Zografos, K., Androustsopoulos, K.: A heuristic algorithm for solving hazardous material distribution problems. European Journal of Operational Research (152), 507–519 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jarosław Rudy .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Rudy, J., Żelazny, D. (2015). Multi-Criteria Fuel Distribution: A Case Study. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2015. Lecture Notes in Computer Science(), vol 9120. Springer, Cham. https://doi.org/10.1007/978-3-319-19369-4_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19369-4_25

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19368-7

  • Online ISBN: 978-3-319-19369-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics