Firework Algorithm For Multi-Objective Optimization Of A Multimodal Transportation Network Problem
This study suggests a multi-objective firework algorithm based on the Pareto-dominance method in order to select the optimistic solution from the multimodal transportation problem. The aim is to determine a shortest and efficient itinerary of satisfying a certain set of demands and operational const...
Uloženo v:
| Vydáno v: | Procedia computer science Ročník 112; s. 1670 - 1682 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
2017
|
| Témata: | |
| ISSN: | 1877-0509, 1877-0509 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | This study suggests a multi-objective firework algorithm based on the Pareto-dominance method in order to select the optimistic solution from the multimodal transportation problem. The aim is to determine a shortest and efficient itinerary of satisfying a certain set of demands and operational constraints. Several publications have appeared in recent years documenting the transportation network analysis. This fact reflects the importance and complexity of this problem. In order to reach a sustainable planning in a rather complicated transport system, it is of high interest to use an approach that belongs to the field of artificial intelligence method. This paper introduces a new multi-objective approach based on firework algorithm that generates n solutions which are then selected according to the Pareto-dominance which is the best compromise between goals. Finally, we present our obtained experimental results, then we compare them with the obtained results by Cplex in order to prove the efficiency of this algorithm. |
|---|---|
| AbstractList | This study suggests a multi-objective firework algorithm based on the Pareto-dominance method in order to select the optimistic solution from the multimodal transportation problem. The aim is to determine a shortest and efficient itinerary of satisfying a certain set of demands and operational constraints. Several publications have appeared in recent years documenting the transportation network analysis. This fact reflects the importance and complexity of this problem. In order to reach a sustainable planning in a rather complicated transport system, it is of high interest to use an approach that belongs to the field of artificial intelligence method. This paper introduces a new multi-objective approach based on firework algorithm that generates n solutions which are then selected according to the Pareto-dominance which is the best compromise between goals. Finally, we present our obtained experimental results, then we compare them with the obtained results by Cplex in order to prove the efficiency of this algorithm. |
| Author | Mnif, Mouna Bouamama, Sadok |
| Author_xml | – sequence: 1 givenname: Mouna surname: Mnif fullname: Mnif, Mouna email: mouna.mnif@ensi-uma.tn organization: ENSI, University of Manouba, COSMOS Laboratory, Tunisia – sequence: 2 givenname: Sadok surname: Bouamama fullname: Bouamama, Sadok organization: ENSI, University of Manouba, COSMOS Laboratory, Tunisia |
| BookMark | eNqFkLFOwzAQhi0EEqX0CVjyAgl20tjxwFBVFJAKZSizZTsXcEjiyDZF8PSkDQNigFvupLvvpP87Q8ed7QChC4ITggm9rJPeWe2TFBOW4CIhBT9CE1IwFuMc8-Mf8ymaeV_jobKi4IRNkFoZB-_WvUaL5tk6E17aaGVddP_WBBNvVA06mB1Emz6Y1nzKYGwXbapoMV60tpRNtHWy8711YVw_QDh8fHRWNdCeo5NKNh5m332KnlbX2-VtvN7c3C0X61hnnIY45Smdq5xlmlKWKU01yTmlUmmMK50XGnhKgBOcyVSVjChMSiUpx6xicwpVNkXZ-Fc7672DSvTOtNJ9CILF3pSoxcGU2JsSuBCDqYHivyhtxhzBSdP8w16NLAyxdgac8NpAp6EcpOogSmv-5L8AzPCJwQ |
| CitedBy_id | crossref_primary_10_1007_s10115_022_01752_y crossref_primary_10_1088_1757_899X_382_3_032005 crossref_primary_10_1016_j_eswa_2023_122042 crossref_primary_10_3390_su15054435 crossref_primary_10_1145_3362788 crossref_primary_10_1016_j_compbiolchem_2020_107363 crossref_primary_10_1016_j_procs_2021_09_210 crossref_primary_10_4018_IJAMC_2020040107 crossref_primary_10_1177_03611981241242377 crossref_primary_10_1108_EC_10_2020_0587 crossref_primary_10_1177_03611981211049148 crossref_primary_10_4018_IJORIS_2020010101 crossref_primary_10_1016_j_procs_2019_09_311 crossref_primary_10_3390_math11102400 crossref_primary_10_4018_IJAMC_2020100105 crossref_primary_10_3390_app15105512 crossref_primary_10_1155_2022_3664105 crossref_primary_10_3390_sym14020221 |
| Cites_doi | 10.1016/j.procs.2015.08.151 10.1109/SOLI.2017.8120985 10.1109/CEC.2013.6557813 |
| ContentType | Journal Article |
| Copyright | 2017 |
| Copyright_xml | – notice: 2017 |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.procs.2017.08.189 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1877-0509 |
| EndPage | 1682 |
| ExternalDocumentID | 10_1016_j_procs_2017_08_189 S1877050917315466 |
| GroupedDBID | --K 0R~ 0SF 1B1 457 5VS 6I. 71M AACTN AAEDT AAEDW AAFTH AAIKJ AALRI AAQFI AAXUO ABMAC ACGFS ADBBV ADEZE AEXQZ AFTJW AGHFR AITUG ALMA_UNASSIGNED_HOLDINGS AMRAJ E3Z EBS EJD EP3 FDB FNPLU HZ~ IXB KQ8 M41 M~E NCXOZ O-L O9- OK1 P2P RIG ROL SES SSZ 9DU AAYWO AAYXX ABWVN ACRPL ACVFH ADCNI ADNMO ADVLN AEUPX AFPUW AIGII AKBMS AKRWK AKYEP CITATION ~HD |
| ID | FETCH-LOGICAL-c396t-29264b573c6673bc6c15966abc00fc58ce921e9103a2bd71b01dba6907f746ef3 |
| ISICitedReferencesCount | 22 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000418466000175&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1877-0509 |
| IngestDate | Sat Nov 29 04:09:44 EST 2025 Tue Nov 18 22:36:27 EST 2025 Tue May 16 23:59:31 EDT 2023 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Multimodal transport Network planning Multiobjective optimization Firework Algorithm |
| Language | English |
| License | This is an open access article under the CC BY-NC-ND license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c396t-29264b573c6673bc6c15966abc00fc58ce921e9103a2bd71b01dba6907f746ef3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.procs.2017.08.189 |
| PageCount | 13 |
| ParticipantIDs | crossref_primary_10_1016_j_procs_2017_08_189 crossref_citationtrail_10_1016_j_procs_2017_08_189 elsevier_sciencedirect_doi_10_1016_j_procs_2017_08_189 |
| PublicationCentury | 2000 |
| PublicationDate | 2017 2017-00-00 |
| PublicationDateYYYYMMDD | 2017-01-01 |
| PublicationDate_xml | – year: 2017 text: 2017 |
| PublicationDecade | 2010 |
| PublicationTitle | Procedia computer science |
| PublicationYear | 2017 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Zheng, S., Janecek, A. & Tan, Y. Enhanced Fireworks Algorithm. Bouamama (bib00013) 2010; 312–321 Li, Zheng, Tan, Member (bib00011) 2016; 1– 14 2069- 2077 (2013). Suganthan (bib0004) 2005; 1– 50 Kaaouache, Bouamama (bib00014) 2015; 60 Mnif, M. & Bouamama, S. Multi-objective and multi-modal transportation planning problems : Overview, Criticism and Contribution. (2017). Mnif, M. & Bouamama, S. A multi-objective formulation for multimodal transportation network’s planning problems. (2017). Mathlouthi, Bouamama (bib00012) 2015; 19 Li, Zheng, Tan (bib0007) 2014; 3214– 3221 Tan, Zhu (bib0003) 2010; 355– 364 Zhang, Zheng, Zhang, Chen (bib0006) 2015; 1–14 Zheng, S., Janecek, A., Li, J. & Tan, Y. Dynamic Search in Fireworks Algorithm. Yu, Tan (bib0009) 2015; 1250– 1256 Zheng, Member, Li, Member, Janecek (bib00010) 2015; 5963 Zhang (10.1016/j.procs.2017.08.189_bib0006) 2015; 1–14 Li (10.1016/j.procs.2017.08.189_bib00011) 2016; 1– 14 Suganthan (10.1016/j.procs.2017.08.189_bib0004) 2005; 1– 50 Li (10.1016/j.procs.2017.08.189_bib0007) 2014; 3214– 3221 Yu (10.1016/j.procs.2017.08.189_bib0009) 2015; 1250– 1256 Mathlouthi (10.1016/j.procs.2017.08.189_bib00012) 2015; 19 Kaaouache (10.1016/j.procs.2017.08.189_bib00014) 2015; 60 10.1016/j.procs.2017.08.189_bib0005 10.1016/j.procs.2017.08.189_bib0002 10.1016/j.procs.2017.08.189_bib0001 Bouamama (10.1016/j.procs.2017.08.189_bib00013) 2010; 312–321 Tan (10.1016/j.procs.2017.08.189_bib0003) 2010; 355– 364 Zheng (10.1016/j.procs.2017.08.189_bib00010) 2015; 5963 10.1016/j.procs.2017.08.189_bib0008 |
| References_xml | – volume: 1– 50 year: 2005 ident: bib0004 article-title: Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization publication-title: Report – volume: 60 start-page: 1061 year: 2015 end-page: 1069 ident: bib00014 article-title: Solving bin packing problem with a hybrid genetic algorithm for VM placement in cloud publication-title: Procedia Comput. Sci. – volume: 1– 14 year: 2016 ident: bib00011 article-title: The Effect of Information Utilization : Introducing a Novel Guiding Spark in the Fireworks Algorithm publication-title: Trans. Evol. Comput. – reference: 2069- 2077 (2013). – volume: 355– 364 year: 2010 ident: bib0003 article-title: Fireworks Algorithm for Optimization publication-title: Springer-Verlag Berlin Heidelb. 2010 – volume: 5963 start-page: 1 year: 2015 end-page: 14 ident: bib00010 article-title: A Cooperative Framework for Fireworks Algorithm publication-title: Trans. Comput. Biol. Bioinforma. – reference: Mnif, M. & Bouamama, S. Multi-objective and multi-modal transportation planning problems : Overview, Criticism and Contribution. (2017). – volume: 1–14 year: 2015 ident: bib0006 article-title: Fireworks algorithm with enhanced fireworks interaction publication-title: IEEE/ACM Trans. Comput. Biol. Bioinforma. – volume: 3214– 3221 year: 2014 ident: bib0007 article-title: Adaptive Fireworks Algorithm publication-title: 2014 IEEE Congr. Evol. Comput. July 6-11, 2014, Beijing, China – reference: Mnif, M. & Bouamama, S. A multi-objective formulation for multimodal transportation network’s planning problems. – volume: 19 start-page: 215 year: 2015 end-page: 224 ident: bib00012 article-title: A family of honey-bee optimization algorithms for Max-CSPs publication-title: Int. J. Knowledge-based Intell. Eng. Syst. – volume: 1250– 1256 year: 2015 ident: bib0009 article-title: Fireworks algorithm with covariance mutation publication-title: 2015 IEEE Congr. Evol. Comput. CEC 2015 - Proc. – reference: Zheng, S., Janecek, A., Li, J. & Tan, Y. Dynamic Search in Fireworks Algorithm. – reference: (2017). – reference: Zheng, S., Janecek, A. & Tan, Y. Enhanced Fireworks Algorithm. – volume: 312–321 year: 2010 ident: bib00013 article-title: A New Distributed Particle Swarm Optimization publication-title: Knowledge-Based Intell. Inf. Eng. Syst. – volume: 60 start-page: 1061 year: 2015 ident: 10.1016/j.procs.2017.08.189_bib00014 article-title: Solving bin packing problem with a hybrid genetic algorithm for VM placement in cloud publication-title: Procedia Comput. Sci. doi: 10.1016/j.procs.2015.08.151 – volume: 5963 start-page: 1 year: 2015 ident: 10.1016/j.procs.2017.08.189_bib00010 article-title: A Cooperative Framework for Fireworks Algorithm publication-title: Trans. Comput. Biol. Bioinforma. – volume: 1–14 year: 2015 ident: 10.1016/j.procs.2017.08.189_bib0006 article-title: Fireworks algorithm with enhanced fireworks interaction publication-title: IEEE/ACM Trans. Comput. Biol. Bioinforma. – ident: 10.1016/j.procs.2017.08.189_bib0008 – volume: 1– 14 year: 2016 ident: 10.1016/j.procs.2017.08.189_bib00011 article-title: The Effect of Information Utilization : Introducing a Novel Guiding Spark in the Fireworks Algorithm publication-title: Trans. Evol. Comput. – volume: 19 start-page: 215 year: 2015 ident: 10.1016/j.procs.2017.08.189_bib00012 article-title: A family of honey-bee optimization algorithms for Max-CSPs publication-title: Int. J. Knowledge-based Intell. Eng. Syst. – volume: 3214– 3221 year: 2014 ident: 10.1016/j.procs.2017.08.189_bib0007 article-title: Adaptive Fireworks Algorithm publication-title: 2014 IEEE Congr. Evol. Comput. July 6-11, 2014, Beijing, China – volume: 1– 50 year: 2005 ident: 10.1016/j.procs.2017.08.189_bib0004 article-title: Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization publication-title: Report – volume: 355– 364 year: 2010 ident: 10.1016/j.procs.2017.08.189_bib0003 article-title: Fireworks Algorithm for Optimization publication-title: Springer-Verlag Berlin Heidelb. 2010 – volume: 312–321 year: 2010 ident: 10.1016/j.procs.2017.08.189_bib00013 article-title: A New Distributed Particle Swarm Optimization publication-title: Knowledge-Based Intell. Inf. Eng. Syst. – volume: 1250– 1256 year: 2015 ident: 10.1016/j.procs.2017.08.189_bib0009 article-title: Fireworks algorithm with covariance mutation publication-title: 2015 IEEE Congr. Evol. Comput. CEC 2015 - Proc. – ident: 10.1016/j.procs.2017.08.189_bib0002 doi: 10.1109/SOLI.2017.8120985 – ident: 10.1016/j.procs.2017.08.189_bib0001 doi: 10.1109/SOLI.2017.8120985 – ident: 10.1016/j.procs.2017.08.189_bib0005 doi: 10.1109/CEC.2013.6557813 |
| SSID | ssj0000388917 |
| Score | 2.1855595 |
| Snippet | This study suggests a multi-objective firework algorithm based on the Pareto-dominance method in order to select the optimistic solution from the multimodal... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1670 |
| SubjectTerms | Firework Algorithm Multimodal transport Multiobjective optimization Network planning |
| Title | Firework Algorithm For Multi-Objective Optimization Of A Multimodal Transportation Network Problem |
| URI | https://dx.doi.org/10.1016/j.procs.2017.08.189 |
| Volume | 112 |
| WOSCitedRecordID | wos000418466000175&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1877-0509 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000388917 issn: 1877-0509 databaseCode: M~E dateStart: 20100101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLdg24ELMDa0jQ_5wC2LFOfDH8cKUXFgLRID7RbFjgOr1mTqOrTT_nbes5200GkaSKhS1LpxXfn98t7PT--DkHeF0baBw09cpU0T5zWDR0qDMlTayiJnslKuHMO3T2IykWdn6nMIyLxy7QRE28qbG3X5X0UNYyBsTJ39C3EPPwoD8B6EDlcQO1wfJPgxKDGMtopGF987OPr_mEfjbhG5TNt4qmdew0VT0BXzkIQZTYGO-jvmXY0Z-33Jc__1xMeKY1YBdp9ZJ7Qu0QAw5mLTsT1EFGzqIMn23NV9PAG1sjr8d9fVHF7eJ10Hnh-cDz7L0vvCNvJhnPqUQsRYUcZblzvGep0bYqe91mTcNw8JFphx349oQ7t7R8MMbYvBUutMYPlVJtXKmA0hhl9wXVyWiQxoIuePyXYq4PiE4Z23Kz8cVsNRrjHz8Ef74lQuDHBjrbsJzBopOX1OnobTBB15FOySR7Z9QZ71nTpoUNx7RPegoAMoKICC_gEKug4KOm3oiK5AQX8HBQ2goAEU--Tr-MPp-49x6K4Rm0zxZZwq4MK6EJnBzq_acAPMlvNKmyRpTCGNVSmzwCazKtW1YDphta7QmdKInNsme0m22q61B4Tmkmt4rrNaJU0OHFQl1hRFZovcMstSc0jSfstKE0rPYweUi7KPMZyVbp9L3OcykSXs8yE5HiZd-sor99_Oe1mUAeieFJaAnvsmHv3rxFfkCX7y_rjXZGu5uLZvyI75uTy_Wrx1KPsFgEmXPA |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Firework+Algorithm+For+Multi-Objective+Optimization+Of+A+Multimodal+Transportation+Network+Problem&rft.jtitle=Procedia+computer+science&rft.au=Mnif%2C+Mouna&rft.au=Bouamama%2C+Sadok&rft.date=2017&rft.pub=Elsevier+B.V&rft.issn=1877-0509&rft.eissn=1877-0509&rft.volume=112&rft.spage=1670&rft.epage=1682&rft_id=info:doi/10.1016%2Fj.procs.2017.08.189&rft.externalDocID=S1877050917315466 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1877-0509&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1877-0509&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1877-0509&client=summon |