Cited By
View all- Davendra DMetlicka MBialic-Davendra M(2020)CUDA Accelerated 2-OPT Local Search for the Traveling Salesman ProblemNovel Trends in the Traveling Salesman Problem10.5772/intechopen.93125Online publication date: 9-Dec-2020
Discrete self organizing algorithm for pollution vehicle routing problem
Pages 1426 - 1433
Abstract
This paper introduces a novel discrete variant of the Self Organizing Migrating Algorithm (DSOMA). Developed on the principle of sequence insertions and the NEH paradigm, the DSOMA algorithm provides a unique application for combinatorial optimization problem. The new algorithm is tested on the Pollution Routing Problem (PRP) dataset and two different minimization objectives of emission and distance are conducted. The results are compared and they show that emission objective is highly significant in reducing emission while not significantly adding to the distance overhead.
Supplementary Material
Supplemental material.
- Download
- 1.88 MB
References
[1]
M. Barth, T. Younglove, and G. Scora. 2005. Development of a Heavy-Duty Diesel Modal Emissions and Fuel Consumption Model. California Partners for Advanced Transit and Highways (PATH) (2005).
[2]
M. Barth, T. Younglove, and G. Scora. 2008. Real-world carbon dioxide impacts of traffic congestion. Transportation Research Record: Journal of the Transportation Research Board 2058 (2008), 163--171.
[3]
Tolga Bektas and Gilbert Laporte. 2011. The Pollution-Routing Problem. Transportation Research Part B: Methodological 45, 8 (2011), 1232 -- 1250. Supply chain disruption and risk management.
[4]
Donald Davendra and Magdalena Bialic-Davendra. 2013. Scheduling flow shops with blocking using a discrete self-organising migrating algorithm. International Journal of Production Research 51, 8 (2013), 2200--2218.
[5]
Donald Davendra, Roman Senkerik, Ivan Zelinka, Michal Pluhacek, and Magdalena Bialic-Davendra. 2014. Utilising the Chaos-Induced Discrete Self Organising Migrating Algorithm to Solve the Lot-Streaming Flowshop Scheduling Problem with Setup Time. Soft Computing 18, 4 (April 2014), 669--681.
[6]
Donald Davendra, Ivan Zelinka, Magdalena Bialic-Davendra, Roman Senkerik, and Roman Jasek. 2013. Discrete Self-Organising Migrating Algorithm for flowshop scheduling with no-wait makespan. Mathematical and Computer Modelling 57 (2013), 100--110.
[7]
Petr Gajdos, Marek Behalek, Jan Janousek, and Pavel Kromer. 2019. QDSOMA: Towards the Utilization of Quantum Computing within SOMA. 2019 IEEE Congress on Evolutionary Computation (CEC) (2019), 2900--2907.
[8]
Pavel Kromer, Jan Janousek, and Jan Platos. 2019. Random Key Self-Organizing Migrating Algorithm for Permutation Problems. 2019 IEEE Congress on Evolutionary Computation (CEC) (2019), 2878--2885.
[9]
R. Nath, A. Rauniyar, P. K. Muhuri, and A. K. Shukla. 2018. A Novel Bilevel Formulation for Pollution Routing Problem. In 2018 IEEE Symposium Series on Computational Intelligence (SSCI). 586--562.
[10]
University of Southampton. 2020. The Pollution-Routing Problem Instance Library. http://www.apollo.management.soton.ac.uk/prplib.htm. (2020).
[11]
H. Ohnishi. 2020. Greenhouse Gas Reduction Strategies in the Transport Sector: Preliminary Report. Tech. rep., OECD/ITF Joint Transport Research Centre Working Group on GHG Reduction Strategies in the Transport Sector, OECD/ITF, Paris. https://www.itf-oecd.org/content/greenhouse-gas-reduction-strategies-transport-sector. (2020).
[12]
A. Palmer. 2007. The Development of an integrated routing and carbon dioxide emissions model for goods vehicles. Ph.D. thesis, Cranfield University, School of Management. (2007).
[13]
I. Zelinka. 2004. SOMA - Self Organizing Migrating Algorithm. In New Optimization Techniques in Engineering, Onwubolu G. and Babu B. (Eds.). Springer-Verlag, Germany.
Index Terms
- Discrete self organizing algorithm for pollution vehicle routing problem
Recommendations
An improved fireworks algorithm for the capacitated vehicle routing problem
The capacitated vehicle routing problem (CVRP), which aims at minimizing travel costs, is a well-known NP-hard combinatorial optimization. Owing to its hardness, many heuristic search algorithms have been proposed to tackle this problem. This paper ...
A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
<P>We develop a generic tabu search heuristic for solving the well-known vehicle routing problem. This algorithm explores the advantages of simple local search and improvement heuristics as well as a complex meta-heuristic. The solutions generated by ...
Evolutionary hyperheuristic for capacitated vehicle routing problem
GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computationIn this paper a novel constructive hyperheuristic for CVRP is proposed. This hyperheuristic, called HyperPOEMS, is based on an evolutionary-based iterative local search algorithm. Its inherent characteristics make it capable of autonomously searching a ...
Comments
Information & Contributors
Information
Published In
Copyright © 2020 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 July 2020
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
GECCO '20
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 57Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)1
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
Cited By
View all- Davendra DMetlicka MBialic-Davendra M(2020)CUDA Accelerated 2-OPT Local Search for the Traveling Salesman ProblemNovel Trends in the Traveling Salesman Problem10.5772/intechopen.93125Online publication date: 9-Dec-2020
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in