Solution to Chance Constrained Programming Problem in Swap Trailer Transport Organisation based on Improved Simulated Annealing Algorithm

Swap trailer transport organisation problem originates from the traditional vehicle routing problem (VRP). Most of the studies on the problems assume that the travelling times of vehicles are fixed values. In this paper, the uncertainties of driving times are considered and a chance constrained prog...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied mathematics and nonlinear sciences Jg. 5; H. 1; S. 47 - 54
Hauptverfasser: Li, Tao, Yang, Wenyin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Beirut Sciendo 01.01.2020
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Schlagworte:
90C05
random driving time
road transport
simulated annealing algorithm
swap trailer transport
tractor despatching
ISSN:2444-8656, 2444-8656
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Swap trailer transport organisation problem originates from the traditional vehicle routing problem (VRP). Most of the studies on the problems assume that the travelling times of vehicles are fixed values. In this paper, the uncertainties of driving times are considered and a chance constrained programming problem is proposed. An improved simulated annealing algorithm is used to solve the problem proposed. The model and algorithm described in this paper are studied through a case study, and the influence of uncertainty on the results is analysed. The conclusion of this study provides theoretical support for the practice of trailer pickup transport.
AbstractList Swap trailer transport organisation problem originates from the traditional vehicle routing problem (VRP). Most of the studies on the problems assume that the travelling times of vehicles are fixed values. In this paper, the uncertainties of driving times are considered and a chance constrained programming problem is proposed. An improved simulated annealing algorithm is used to solve the problem proposed. The model and algorithm described in this paper are studied through a case study, and the influence of uncertainty on the results is analysed. The conclusion of this study provides theoretical support for the practice of trailer pickup transport.
Author Yang, Wenyin
Li, Tao
Author_xml – sequence: 1
  givenname: Tao
  surname: Li
  fullname: Li, Tao
  email: 836407231@qq.com
  organization: Research Institute of Highway Ministry of Transport, Beijing100088, China
– sequence: 2
  givenname: Wenyin
  surname: Yang
  fullname: Yang, Wenyin
  organization: Transport Planning and Research Institute, Ministry of Transport, Beijing100028, China
BookMark eNp9kM1O4zAUhS1UJDrAA7CLxLod_8VJFiyqaoZBQmKkwtpykpvgyrE7tjMVj8Bb47RIoJEGb-63OOf43vMNzayzgNAVwUvKi_K7GmxYUkzxkixxevkJmlPO-aIUuZh94jN0GcI2KSgjTAg6R68bZ8aonc2iy9bPyjaQrZ0N0Sttoc1-e9d7NQza9hPXBoZM22yzV7vsMWkM-GnasHM-Zg--V1YHdQisVUgBCe6GnXd_E2_0MBoVE62sBWWm0JXpndfxebhAp50yAS7f5zl6-vnjcf1rcf9we7de3S8aVuC4YHVeVlXTdqLuWFeUqmtVzjpBCAjBKsZLaGmueNHkNWbQEi4wYFqxFkrgHWPn6PqYm5b6M0KIcutGb9OXkpGKUCZoWSZVcVQ13oXgoZONjoe7pmaMJFhO1cupejlVL4k8VJ-c5B_nzutB-ZcvPTdHz16ZCL6F3o8vCT5W-683J7xgb_i0oHs
CitedBy_id crossref_primary_10_1007_s00521_021_06690_4
crossref_primary_10_1007_s00521_022_06998_9
crossref_primary_10_3233_JCM_215549
crossref_primary_10_3390_aerospace12070621
crossref_primary_10_1515_phys_2020_0185
crossref_primary_10_3233_JCM_215450
crossref_primary_10_1155_2021_1326357
crossref_primary_10_3390_coatings12050586
crossref_primary_10_1155_2022_2264876
crossref_primary_10_1155_2022_4070131
crossref_primary_10_3389_fphy_2020_00224
crossref_primary_10_3390_sym12091474
Cites_doi 10.1016/j.ejor.2013.04.026
10.1016/j.cor.2012.06.008
10.1016/S0305-0548(00)00056-3
10.1016/j.ijpe.2010.01.013
10.1016/j.cor.2005.02.023
10.1287/mnsc.6.1.73
10.1287/trsc.34.3.271.12301
10.1007/BF02023006
ContentType Journal Article
Copyright 2020. This work is published under http://creativecommons.org/licenses/by/4.0 (the "License"). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2020. This work is published under http://creativecommons.org/licenses/by/4.0 (the "License"). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
ABUWG
AFKRA
AZQEC
BENPR
CCPQU
DWQXO
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
DOI 10.2478/amns.2020.1.00005
DatabaseName CrossRef
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
ProQuest One Community College
ProQuest Central
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
DatabaseTitle CrossRef
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList Publicly Available Content Database
CrossRef
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
EISSN 2444-8656
EndPage 54
ExternalDocumentID 10_2478_amns_2020_1_00005
10_2478_amns_2020_1_000055147
GroupedDBID 9WM
AATOW
ABFKT
ADBLJ
AFFHD
AFKRA
AHGSO
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARCSS
BENPR
CCPQU
EBS
M~E
OK1
PHGZM
PHGZT
PIMPY
QD8
SLJYH
AAYXX
CITATION
ABUWG
AZQEC
DWQXO
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c370t-3b5899cdf6bf3f78afda53f611e6639348ed25a47c5b03ed1460e0293de8e4f33
IEDL.DBID BENPR
ISICitedReferencesCount 23
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000664154800005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2444-8656
IngestDate Wed Nov 19 00:48:17 EST 2025
Sat Nov 29 05:04:15 EST 2025
Tue Nov 18 20:50:27 EST 2025
Sat Nov 29 01:30:10 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License This work is licensed under the Creative Commons Attribution 4.0 International License.
http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c370t-3b5899cdf6bf3f78afda53f611e6639348ed25a47c5b03ed1460e0293de8e4f33
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://www.proquest.com/docview/3191236288?pq-origsite=%requestingapplication%
PQID 3191236288
PQPubID 6761185
PageCount 8
ParticipantIDs proquest_journals_3191236288
crossref_citationtrail_10_2478_amns_2020_1_00005
crossref_primary_10_2478_amns_2020_1_00005
walterdegruyter_journals_10_2478_amns_2020_1_000055147
PublicationCentury 2000
PublicationDate 2020-01-01
20200101
PublicationDateYYYYMMDD 2020-01-01
PublicationDate_xml – month: 01
  year: 2020
  text: 2020-01-01
  day: 01
PublicationDecade 2020
PublicationPlace Beirut
PublicationPlace_xml – name: Beirut
PublicationTitle Applied mathematics and nonlinear sciences
PublicationYear 2020
Publisher Sciendo
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Publisher_xml – name: Sciendo
– name: De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
References Chao, I M (j_amns.2020.1.00005_ref_003_w2aab3b7d289b1b6b1ab2ab3Aa) 2002; 29
Villegas, J G; Prins, C; Prodhon, C (j_amns.2020.1.00005_ref_004_w2aab3b7d289b1b6b1ab2ab4Aa) 2013; 230
Bodin, L; Mingozzi, A; Baldacci, R (j_amns.2020.1.00005_ref_005_w2aab3b7d289b1b6b1ab2ab5Aa) 2000; 34
Baldacci, R; Bodin, L; Mingozzi, A (j_amns.2020.1.00005_ref_006_w2aab3b7d289b1b6b1ab2ab6Aa) 2006; 33
Li, X; Peng, T; Leung, S C H (j_amns.2020.1.00005_ref_010_w2aab3b7d289b1b6b1ab2ac10Aa) 2010; 125
Duygu, T; Dellaert, N; Tom, V W (j_amns.2020.1.00005_ref_011_w2aab3b7d289b1b6b1ab2ac11Aa) 2013; 40
Semet, F; Taillard, E (j_amns.2020.1.00005_ref_001_w2aab3b7d289b1b6b1ab2ab1Aa) 1993; 41
Li, Y (j_amns.2020.1.00005_ref_002_w2aab3b7d289b1b6b1ab2ab2Aa) 2004; 21
Charnes, A; Cooper, W W (j_amns.2020.1.00005_ref_012_w2aab3b7d289b1b6b1ab2ac12Aa) 1959; 6
2024050203525380092_j_amns.2020.1.00005_ref_009_w2aab3b7d289b1b6b1ab2ab9Aa
2024050203525380092_j_amns.2020.1.00005_ref_012_w2aab3b7d289b1b6b1ab2ac12Aa
2024050203525380092_j_amns.2020.1.00005_ref_008_w2aab3b7d289b1b6b1ab2ab8Aa
2024050203525380092_j_amns.2020.1.00005_ref_007_w2aab3b7d289b1b6b1ab2ab7Aa
2024050203525380092_j_amns.2020.1.00005_ref_006_w2aab3b7d289b1b6b1ab2ab6Aa
2024050203525380092_j_amns.2020.1.00005_ref_005_w2aab3b7d289b1b6b1ab2ab5Aa
2024050203525380092_j_amns.2020.1.00005_ref_010_w2aab3b7d289b1b6b1ab2ac10Aa
2024050203525380092_j_amns.2020.1.00005_ref_004_w2aab3b7d289b1b6b1ab2ab4Aa
2024050203525380092_j_amns.2020.1.00005_ref_003_w2aab3b7d289b1b6b1ab2ab3Aa
2024050203525380092_j_amns.2020.1.00005_ref_011_w2aab3b7d289b1b6b1ab2ac11Aa
2024050203525380092_j_amns.2020.1.00005_ref_002_w2aab3b7d289b1b6b1ab2ab2Aa
2024050203525380092_j_amns.2020.1.00005_ref_001_w2aab3b7d289b1b6b1ab2ab1Aa
References_xml – volume: 230
  start-page: 231
  issue: 2
  year: 2013
  end-page: 244
  ident: j_amns.2020.1.00005_ref_004_w2aab3b7d289b1b6b1ab2ab4Aa
  article-title: A matheuristic for the truck and trailer routing problem
  publication-title: European Journal of Operational Research
– volume: 125
  start-page: 137
  issue: 1
  year: 2010
  end-page: 145
  ident: j_amns.2020.1.00005_ref_010_w2aab3b7d289b1b6b1ab2ac10Aa
  article-title: Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm
  publication-title: International Journal of Production Economics
– volume: 33
  start-page: 2667
  issue: 9
  year: 2006
  end-page: 2702
  ident: j_amns.2020.1.00005_ref_006_w2aab3b7d289b1b6b1ab2ab6Aa
  article-title: The multiple disposal facilities and multiple inventory locations rollon–rolloff vehicle routing problem
  publication-title: Computers & Operations Research
– volume: 40
  start-page: 214
  issue: 1
  year: 2013
  end-page: 224
  ident: j_amns.2020.1.00005_ref_011_w2aab3b7d289b1b6b1ab2ac11Aa
  article-title: Vehicle routing problem with stochastic travel times including soft time windows and service costs
  publication-title: Computers & Operations Research
– volume: 21
  start-page: 119
  issue: 4
  year: 2004
  end-page: 122
  ident: j_amns.2020.1.00005_ref_002_w2aab3b7d289b1b6b1ab2ab2Aa
  article-title: Semi-trailer swap transport: an effective way to improve road transport efficiency
  publication-title: Journal of Highway and Transportation Research and Development
– volume: 29
  start-page: 33
  issue: 1
  year: 2002
  end-page: 51
  ident: j_amns.2020.1.00005_ref_003_w2aab3b7d289b1b6b1ab2ab3Aa
  article-title: A tabu search method for the truck and trailer routing problem
  publication-title: J. Computers & Operations Research
– volume: 41
  start-page: 469
  issue: 4
  year: 1993
  end-page: 488
  ident: j_amns.2020.1.00005_ref_001_w2aab3b7d289b1b6b1ab2ab1Aa
  article-title: Solving real-life vehicle routing problems efficiently using tabu search
  publication-title: Annals of Operations Research
– volume: 34
  start-page: 271
  issue: 3
  year: 2000
  end-page: 288
  ident: j_amns.2020.1.00005_ref_005_w2aab3b7d289b1b6b1ab2ab5Aa
  article-title: The rollon–rolloff vehicle routing problem
  publication-title: J. Transportation Science
– volume: 6
  start-page: 73
  issue: 6
  year: 1959
  end-page: 79
  ident: j_amns.2020.1.00005_ref_012_w2aab3b7d289b1b6b1ab2ac12Aa
  article-title: Chance-Constrained Programming
  publication-title: Management Science
– ident: 2024050203525380092_j_amns.2020.1.00005_ref_004_w2aab3b7d289b1b6b1ab2ab4Aa
  doi: 10.1016/j.ejor.2013.04.026
– ident: 2024050203525380092_j_amns.2020.1.00005_ref_007_w2aab3b7d289b1b6b1ab2ab7Aa
– ident: 2024050203525380092_j_amns.2020.1.00005_ref_008_w2aab3b7d289b1b6b1ab2ab8Aa
– ident: 2024050203525380092_j_amns.2020.1.00005_ref_011_w2aab3b7d289b1b6b1ab2ac11Aa
  doi: 10.1016/j.cor.2012.06.008
– ident: 2024050203525380092_j_amns.2020.1.00005_ref_003_w2aab3b7d289b1b6b1ab2ab3Aa
  doi: 10.1016/S0305-0548(00)00056-3
– ident: 2024050203525380092_j_amns.2020.1.00005_ref_009_w2aab3b7d289b1b6b1ab2ab9Aa
– ident: 2024050203525380092_j_amns.2020.1.00005_ref_010_w2aab3b7d289b1b6b1ab2ac10Aa
  doi: 10.1016/j.ijpe.2010.01.013
– ident: 2024050203525380092_j_amns.2020.1.00005_ref_002_w2aab3b7d289b1b6b1ab2ab2Aa
– ident: 2024050203525380092_j_amns.2020.1.00005_ref_006_w2aab3b7d289b1b6b1ab2ab6Aa
  doi: 10.1016/j.cor.2005.02.023
– ident: 2024050203525380092_j_amns.2020.1.00005_ref_012_w2aab3b7d289b1b6b1ab2ac12Aa
  doi: 10.1287/mnsc.6.1.73
– ident: 2024050203525380092_j_amns.2020.1.00005_ref_005_w2aab3b7d289b1b6b1ab2ab5Aa
  doi: 10.1287/trsc.34.3.271.12301
– ident: 2024050203525380092_j_amns.2020.1.00005_ref_001_w2aab3b7d289b1b6b1ab2ab1Aa
  doi: 10.1007/BF02023006
SSID ssj0002313662
Score 2.2330399
Snippet Swap trailer transport organisation problem originates from the traditional vehicle routing problem (VRP). Most of the studies on the problems assume that the...
SourceID proquest
crossref
walterdegruyter
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 47
SubjectTerms 90C05
random driving time
road transport
simulated annealing algorithm
swap trailer transport
tractor despatching
Title Solution to Chance Constrained Programming Problem in Swap Trailer Transport Organisation based on Improved Simulated Annealing Algorithm
URI https://reference-global.com/article/10.2478/amns.2020.1.00005
https://www.proquest.com/docview/3191236288
Volume 5
WOSCitedRecordID wos000664154800005&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: 2444-8656
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002313662
  issn: 2444-8656
  databaseCode: M~E
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2444-8656
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002313662
  issn: 2444-8656
  databaseCode: BENPR
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 2444-8656
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002313662
  issn: 2444-8656
  databaseCode: PIMPY
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Nj9MwELWg3QOXlo9dUViQD5yQoiZx7DinVUFbwYEqYhepnCLHdrqV2rS0KdX-BP41M4nTipW2F07xwXaizHjmecaeR8gHxpgKeB57Vke-FxWF8CTYYi9IDA8t4AnJdE02EU8mcjpNUhdw27pjla1NrA21WWmMkQ9BVbBQSCjl1fqXh6xRmF11FBpPSRcrlYGedz9dT9LvhygLoBcmRNikM8MolkO1LLFKdwjGoq5dyP91SEeU2dvX-WpjZ5vdfdXmR2u3M-7_7wc_Jz0HOOmo0ZAX5IktX5K-A5_ULe3tK_KnDZDRakXxzoG2FNk8aw4J6Jk2B7mW4OqwjSw0dF7Sm71aU3B4YFw29FApnTZXPJuTQhQ9paHQaCIY-Nr5EmnDoDUCO6_wSjwdLWbw-dXd8pz8GF_ffv7iOZ4GT7PYrzyWc9i1aVOIvGBFLFVhFGeFCAILeCZhkbQm5CqKNc99Zg0YZ9_6gDOMlTYqGLsgnXJV2teExkaqhGsh84hFRiRKWMO5VQx2Xj7P9YD4rbAy7YqY439YZLCZQflmKN8M5ZsFWS3fAfl4GLJuKnic6nzZCjNzi3mbHSU5IOKBVhx7PTonQNL4zel535JnOKIJ7VySTrXZ2XfkTP-u5tvNe6fU8Ey_fkt__gWYZAX1
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NbtQwEB5VWyS4tPyqCwV8gAtS1CS2E-eA0Aqoumq7WokilVNwbKes1M0uuymrPgIvwzMyEye7AoneeuDmg-1Ik8_f_NgzA_CKc64jWaSBMyIMRFkmgUIuDqLMytihPaG4aZpNpKOROj_Pxlvwq8uFoWeVHSc2RG1nhmLkBwgVKhQSK_Vu_j2grlF0u9q10PCwOHbXK3TZlm-HH_D_vo7jw49n74-CtqtAYHga1gEvJPoYxpZJUfIyVbq0WvIyiSKH2jfjQjkbSy1SI4uQO4tUEroQtaJ1yomSAqBI-duCwN6D7fHwdPxlHdVBa4knSeyvT2ORqgM9ragqeIzk1NRKlH8qwI1Vu7Nq7setu1hcXdfdfWyj5g53_zcB3Yed1qBmA38CHsCWqx7Cbmtcs5a6lo_gZxcAZPWMUU6FcYy6lTY9MnDm2D9Um6IqpzF12WGTin1a6TlDhY7kuWDrSvDMp7D6l1CMLAHLcOAjNPTZyZTaouFogHpMU8o_G1xeoLjqb9PH8PlWBPIEetWscnvAUqt0Jk2iCsGFTTKdOCul0xw9y1AWpg9hB47ctEXaSQ6XOTprhKec8JQTnvIob_DUhzfrJXNfoeSmyfsdePKWrJb5Bjl9SP5C4WbWP_dEkzt9evO-L-Hu0dnpSX4yHB0_g3u02oex9qFXL67cc7hjftST5eJFe6AYfL1tiP4GY2Zh1Q
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=Solution+to+Chance+Constrained+Programming+Problem+in+Swap+Trailer+Transport+Organisation+based+on+Improved+Simulated+Annealing+Algorithm&rft.jtitle=Applied+mathematics+and+nonlinear+sciences&rft.au=Li%2C+Tao&rft.au=Yang%2C+Wenyin&rft.date=2020-01-01&rft.pub=De+Gruyter+Brill+Sp.+z+o.o.%2C+Paradigm+Publishing+Services&rft.eissn=2444-8656&rft.volume=5&rft.issue=1&rft.spage=47&rft.epage=54&rft_id=info:doi/10.2478%2Famns.2020.1.00005
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2444-8656&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2444-8656&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2444-8656&client=summon