Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/92555
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Electrical Engineering | en_US |
dc.creator | Sabar, NR | en_US |
dc.creator | Bhaskar, A | en_US |
dc.creator | Chung, E | en_US |
dc.creator | Turky, A | en_US |
dc.creator | Song, A | en_US |
dc.date.accessioned | 2022-04-26T06:00:38Z | - |
dc.date.available | 2022-04-26T06:00:38Z | - |
dc.identifier.issn | 2210-6502 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/92555 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier BV | en_US |
dc.rights | © 2020 Elsevier B.V. All rights reserved. | en_US |
dc.rights | © 2020. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/. | en_US |
dc.rights | The following publication Sabar, N. R., Bhaskar, A., Chung, E., Turky, A., & Song, A. (2020). An Adaptive Memetic Approach for Heterogeneous Vehicle Routing Problems with two-dimensional loading constraints. Swarm and Evolutionary Computation, 58, 100730 is available at https://dx.doi.org/10.1016/j.swevo.2020.100730. | en_US |
dc.subject | Adaptive algorithm | en_US |
dc.subject | Memetic algorithm | en_US |
dc.subject | Multi-methods | en_US |
dc.subject | Vehicle routing | en_US |
dc.title | An adaptive memetic approach for heterogeneous vehicle routing problems with two-dimensional loading constraints | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.volume | 58 | en_US |
dc.identifier.doi | 10.1016/j.swevo.2020.100730 | en_US |
dcterms.abstract | The heterogeneous fleet vehicle routing problem with two-dimensional loading constraints (2L- HFVRP) is a complex variant of the classical vehicle routing problem. 2L-HFVRP seeks for minimal cost set of routes to serve a set of customers using a fleet of vehicles of different capacities, fixed and variable operating costs, different dimensions, and restricted loading constraints. To effectively deal with the 2L-HFVRP, we propose a two-stage method that successively calls the routing stage and the packing stage. For the routing stage, we propose an adaptive memetic approach that integrates new multi-parent crossover operators with multi-local search algorithms in an adaptive manner. A time-varying fitness function is proposed to avoid prematurity and improve search performance. An adaptive quality-and-diversity selection mechanism is devised to control the application of the memetic operators and the local search algorithms. In the packing stage, five heuristics are adopted and hybridised to perform the packing process. Experiments on a set of 36 2L-HFVRP benchmark instances demonstrate that the proposed method provides highly competitive results in comparison with state-of-the-art algorithms. In particular, the proposed method obtains the best results for several instances. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Swarm and evolutionary computation, Nov. 2020, v. 58, 100730 | en_US |
dcterms.isPartOf | Swarm and evolutionary computation | en_US |
dcterms.issued | 2020-11 | - |
dc.identifier.scopus | 2-s2.0-85086828811 | - |
dc.identifier.eissn | 2210-6510 | en_US |
dc.identifier.artn | 100730 | en_US |
dc.description.validate | 202204 bcrc | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | a1263 | - |
dc.identifier.SubFormID | 44389 | - |
dc.description.fundingSource | Self-funded | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Sabar_Adaptive_Memetic_Approach.pdf | Pre-Published version | 1.18 MB | Adobe PDF | View/Open |
Page views
49
Last Week
1
1
Last month
Citations as of May 19, 2024
Downloads
45
Citations as of May 19, 2024
SCOPUSTM
Citations
33
Citations as of May 16, 2024
WEB OF SCIENCETM
Citations
24
Citations as of May 16, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.