Loading…
Two heuristic solution concepts for the vehicle selection problem in line haul transports
► A mathematical model for vehicle selection for line haul in hub-and-spoke networks is developed. ► Two different heuristic solution concepts are proposed based on real life problem properties. ► Their efficiency for different generated problems is analyzed. ► Conditions are stated in which cases s...
Saved in:
| Published in: | European journal of operational research 2012-03, Vol.217 (2), p.448-458 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Citations: | Items that this one cites Items that cite this one |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| cited_by | cdi_FETCH-LOGICAL-c443t-55412721ba9856beb4631dece6c46b5a3f77b9400b893f65ea8c0eb70c13dc183 |
|---|---|
| cites | cdi_FETCH-LOGICAL-c443t-55412721ba9856beb4631dece6c46b5a3f77b9400b893f65ea8c0eb70c13dc183 |
| container_end_page | 458 |
| container_issue | 2 |
| container_start_page | 448 |
| container_title | European journal of operational research |
| container_volume | 217 |
| creator | Zäpfel, Günther Bögl, Michael |
| description | ► A mathematical model for vehicle selection for line haul in hub-and-spoke networks is developed. ► Two different heuristic solution concepts are proposed based on real life problem properties. ► Their efficiency for different generated problems is analyzed. ► Conditions are stated in which cases such heuristic solution concepts lead to good results.
In this article we will develop a mathematical model for a cost-efficient selection of vehicles with varying capacities for line haul transports with leasing options. For this integer optimization problem, which is a variant of the generalized assignment problem known as NP-hard, we will compare two heuristic solution concepts and try to answer the question in which cases a user should choose an exact or approximate solution concept depending on different data instances of the problem. |
| doi_str_mv | 10.1016/j.ejor.2011.09.010 |
| format | article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_963865368</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221711008137</els_id><sourcerecordid>2508492251</sourcerecordid><originalsourceid>FETCH-LOGICAL-c443t-55412721ba9856beb4631dece6c46b5a3f77b9400b893f65ea8c0eb70c13dc183</originalsourceid><addsrcrecordid>eNp9kEFv1DAQhS1EJZaWP8DJQkKcEsZ2bCcSF1QBrVSJSzn0ZDneidaRN148SRH_vglbceDAaS7fe_P0MfZWQC1AmI9jjWMutQQhauhqEPCC7URrZWVaAy_ZDpS1lZTCvmKviUYAEFroHXu4_5X5AZcSaY6BU07LHPPEQ54CnmbiQy58PiB_xEMMCTlhwvAHOZXcJzzyOPEUJ-QHvyQ-Fz_RKZeZrtjF4BPhm-d7yX58_XJ_fVPdff92e_35rgpNo-ZK60ZIK0Xvu1abHvvGKLHHgCY0ptdeDdb2XQPQt50ajEbfBsDeQhBqH0SrLtmHc--65-eCNLtjpIAp-QnzQq4zqjVamY189w855qVM6zjXgZJCtWqD5BkKJRMVHNypxKMvv50At7l2o9tcu821g86trtfQ--dmT8GnYZUQIv1NSm2kVXbjPp05XIU8RiyOQsTV9D6W1arb5_i_N0_3npVK</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>903213838</pqid></control><display><type>article</type><title>Two heuristic solution concepts for the vehicle selection problem in line haul transports</title><source>ScienceDirect Journals</source><creator>Zäpfel, Günther ; Bögl, Michael</creator><creatorcontrib>Zäpfel, Günther ; Bögl, Michael</creatorcontrib><description>► A mathematical model for vehicle selection for line haul in hub-and-spoke networks is developed. ► Two different heuristic solution concepts are proposed based on real life problem properties. ► Their efficiency for different generated problems is analyzed. ► Conditions are stated in which cases such heuristic solution concepts lead to good results.
In this article we will develop a mathematical model for a cost-efficient selection of vehicles with varying capacities for line haul transports with leasing options. For this integer optimization problem, which is a variant of the generalized assignment problem known as NP-hard, we will compare two heuristic solution concepts and try to answer the question in which cases a user should choose an exact or approximate solution concept depending on different data instances of the problem.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2011.09.010</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Applied sciences ; Approximation ; Assignment problem ; Decision theory. Utility theory ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Freight ; Heuristic ; Heuristics ; Integer programming ; Leasing ; Logistics ; Mathematical models ; Operational research ; Operational research and scientific management ; Operational research. Management science ; Optimization ; Planning model for line haul transport ; Studies ; Transport ; Vehicle selection in networks ; Vehicles</subject><ispartof>European journal of operational research, 2012-03, Vol.217 (2), p.448-458</ispartof><rights>2011 Elsevier B.V.</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Mar 1, 2012</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c443t-55412721ba9856beb4631dece6c46b5a3f77b9400b893f65ea8c0eb70c13dc183</citedby><cites>FETCH-LOGICAL-c443t-55412721ba9856beb4631dece6c46b5a3f77b9400b893f65ea8c0eb70c13dc183</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=25627370$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Zäpfel, Günther</creatorcontrib><creatorcontrib>Bögl, Michael</creatorcontrib><title>Two heuristic solution concepts for the vehicle selection problem in line haul transports</title><title>European journal of operational research</title><description>► A mathematical model for vehicle selection for line haul in hub-and-spoke networks is developed. ► Two different heuristic solution concepts are proposed based on real life problem properties. ► Their efficiency for different generated problems is analyzed. ► Conditions are stated in which cases such heuristic solution concepts lead to good results.
In this article we will develop a mathematical model for a cost-efficient selection of vehicles with varying capacities for line haul transports with leasing options. For this integer optimization problem, which is a variant of the generalized assignment problem known as NP-hard, we will compare two heuristic solution concepts and try to answer the question in which cases a user should choose an exact or approximate solution concept depending on different data instances of the problem.</description><subject>Applied sciences</subject><subject>Approximation</subject><subject>Assignment problem</subject><subject>Decision theory. Utility theory</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Freight</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Integer programming</subject><subject>Leasing</subject><subject>Logistics</subject><subject>Mathematical models</subject><subject>Operational research</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Optimization</subject><subject>Planning model for line haul transport</subject><subject>Studies</subject><subject>Transport</subject><subject>Vehicle selection in networks</subject><subject>Vehicles</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNp9kEFv1DAQhS1EJZaWP8DJQkKcEsZ2bCcSF1QBrVSJSzn0ZDneidaRN148SRH_vglbceDAaS7fe_P0MfZWQC1AmI9jjWMutQQhauhqEPCC7URrZWVaAy_ZDpS1lZTCvmKviUYAEFroHXu4_5X5AZcSaY6BU07LHPPEQ54CnmbiQy58PiB_xEMMCTlhwvAHOZXcJzzyOPEUJ-QHvyQ-Fz_RKZeZrtjF4BPhm-d7yX58_XJ_fVPdff92e_35rgpNo-ZK60ZIK0Xvu1abHvvGKLHHgCY0ptdeDdb2XQPQt50ajEbfBsDeQhBqH0SrLtmHc--65-eCNLtjpIAp-QnzQq4zqjVamY189w855qVM6zjXgZJCtWqD5BkKJRMVHNypxKMvv50At7l2o9tcu821g86trtfQ--dmT8GnYZUQIv1NSm2kVXbjPp05XIU8RiyOQsTV9D6W1arb5_i_N0_3npVK</recordid><startdate>20120301</startdate><enddate>20120301</enddate><creator>Zäpfel, Günther</creator><creator>Bögl, Michael</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7TA</scope><scope>JG9</scope></search><sort><creationdate>20120301</creationdate><title>Two heuristic solution concepts for the vehicle selection problem in line haul transports</title><author>Zäpfel, Günther ; Bögl, Michael</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c443t-55412721ba9856beb4631dece6c46b5a3f77b9400b893f65ea8c0eb70c13dc183</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Applied sciences</topic><topic>Approximation</topic><topic>Assignment problem</topic><topic>Decision theory. Utility theory</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Freight</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Integer programming</topic><topic>Leasing</topic><topic>Logistics</topic><topic>Mathematical models</topic><topic>Operational research</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Optimization</topic><topic>Planning model for line haul transport</topic><topic>Studies</topic><topic>Transport</topic><topic>Vehicle selection in networks</topic><topic>Vehicles</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zäpfel, Günther</creatorcontrib><creatorcontrib>Bögl, Michael</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Materials Business File</collection><collection>Materials Research Database</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zäpfel, Günther</au><au>Bögl, Michael</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Two heuristic solution concepts for the vehicle selection problem in line haul transports</atitle><jtitle>European journal of operational research</jtitle><date>2012-03-01</date><risdate>2012</risdate><volume>217</volume><issue>2</issue><spage>448</spage><epage>458</epage><pages>448-458</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>► A mathematical model for vehicle selection for line haul in hub-and-spoke networks is developed. ► Two different heuristic solution concepts are proposed based on real life problem properties. ► Their efficiency for different generated problems is analyzed. ► Conditions are stated in which cases such heuristic solution concepts lead to good results.
In this article we will develop a mathematical model for a cost-efficient selection of vehicles with varying capacities for line haul transports with leasing options. For this integer optimization problem, which is a variant of the generalized assignment problem known as NP-hard, we will compare two heuristic solution concepts and try to answer the question in which cases a user should choose an exact or approximate solution concept depending on different data instances of the problem.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2011.09.010</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 2012-03, Vol.217 (2), p.448-458 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_963865368 |
| source | ScienceDirect Journals |
| subjects | Applied sciences Approximation Assignment problem Decision theory. Utility theory Exact sciences and technology Flows in networks. Combinatorial problems Freight Heuristic Heuristics Integer programming Leasing Logistics Mathematical models Operational research Operational research and scientific management Operational research. Management science Optimization Planning model for line haul transport Studies Transport Vehicle selection in networks Vehicles |
| title | Two heuristic solution concepts for the vehicle selection problem in line haul transports |
| url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T20%3A50%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Two%20heuristic%20solution%20concepts%20for%20the%20vehicle%20selection%20problem%20in%20line%20haul%20transports&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Z%C3%A4pfel,%20G%C3%BCnther&rft.date=2012-03-01&rft.volume=217&rft.issue=2&rft.spage=448&rft.epage=458&rft.pages=448-458&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2011.09.010&rft_dat=%3Cproquest_cross%3E2508492251%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c443t-55412721ba9856beb4631dece6c46b5a3f77b9400b893f65ea8c0eb70c13dc183%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=903213838&rft_id=info:pmid/&rfr_iscdi=true |