Probability model to solve the school bus routing problem with stops selection
This paper describes the use of a new algorithm that solves the school bus routing problem with stops selection. The aim is to reduce the travel time of a set of buses that transport students to a school. The fundamental contribution of the authors is the use of a probability model to describe the f...
Gespeichert in:
| Veröffentlicht in: | International Journal of Combinatorial Optimization Problems and Informatics 2016-01, Vol.7 (1), p.30-39 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 39 |
|---|---|
| container_issue | 1 |
| container_start_page | 30 |
| container_title | International Journal of Combinatorial Optimization Problems and Informatics |
| container_volume | 7 |
| creator | Pérez-Rodríguez, Ricardo Hernández-Aguirre, Arturo |
| description | This paper describes the use of a new algorithm that solves the school bus routing problem with stops selection. The aim is to reduce the travel time of a set of buses that transport students to a school. The fundamental contribution of the authors is the use of a probability model to describe the feasible solution space distribution and thus to get the best solution. An estimation of distribution algorithm is used to address the combinatorial complexity of the problem statement. Different and better results are obtained with the proposed algorithm against a genetic algorithm. The contribution of this paper is to propose an alternative to solve permutation-based representation problems with logistics application. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_1825512120</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1825512120</sourcerecordid><originalsourceid>FETCH-LOGICAL-p146t-1a9fb7a7de7e00b3ca1c91c9dd4b946eafdca1309280911e98fae23601a0a3713</originalsourceid><addsrcrecordid>eNpdTk1LxDAUDILgsu5_CHjxUngvaZvmKItfsKgHPZekfbVZ0mZtUsV_b0BPDgMDw8wwZ2wjAFSBVdVcsF2MR8hoACoNG_b0sgRrrPMuffMp9OR5CjwG_0k8jcRjN4bguV0jX8Ka3PzOT7nhaeJfLo08pnCKPJKnLrkwX7LzwfhIuz_dsre729f9Q3F4vn_c3xyKE5Z1KtDowSqjelIEYGVnsNOZfV9aXdZkhj5bErRoQCOSbgZDQtaABoxUKLfs-nc3n_lYKaZ2crEj781MYY0tNqKqUKCAHL36Fz2GdZnzuxaVLrFGqFH-AN8cWNc</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1794161061</pqid></control><display><type>article</type><title>Probability model to solve the school bus routing problem with stops selection</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Pérez-Rodríguez, Ricardo ; Hernández-Aguirre, Arturo</creator><creatorcontrib>Pérez-Rodríguez, Ricardo ; Hernández-Aguirre, Arturo</creatorcontrib><description>This paper describes the use of a new algorithm that solves the school bus routing problem with stops selection. The aim is to reduce the travel time of a set of buses that transport students to a school. The fundamental contribution of the authors is the use of a probability model to describe the feasible solution space distribution and thus to get the best solution. An estimation of distribution algorithm is used to address the combinatorial complexity of the problem statement. Different and better results are obtained with the proposed algorithm against a genetic algorithm. The contribution of this paper is to propose an alternative to solve permutation-based representation problems with logistics application.</description><identifier>EISSN: 2007-1558</identifier><language>eng</language><publisher>Jiutepec: International Journal of Combinatorial Optimization Problems & Informatics</publisher><subject>Algorithms ; Buses (vehicles) ; Combinatorial analysis ; Logistics ; Mathematical models ; Optimization ; Plugs ; Representations</subject><ispartof>International Journal of Combinatorial Optimization Problems and Informatics, 2016-01, Vol.7 (1), p.30-39</ispartof><rights>Copyright International Journal of Combinatorial Optimization Problems & Informatics Jan 2016-Apr 2016</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784</link.rule.ids></links><search><creatorcontrib>Pérez-Rodríguez, Ricardo</creatorcontrib><creatorcontrib>Hernández-Aguirre, Arturo</creatorcontrib><title>Probability model to solve the school bus routing problem with stops selection</title><title>International Journal of Combinatorial Optimization Problems and Informatics</title><description>This paper describes the use of a new algorithm that solves the school bus routing problem with stops selection. The aim is to reduce the travel time of a set of buses that transport students to a school. The fundamental contribution of the authors is the use of a probability model to describe the feasible solution space distribution and thus to get the best solution. An estimation of distribution algorithm is used to address the combinatorial complexity of the problem statement. Different and better results are obtained with the proposed algorithm against a genetic algorithm. The contribution of this paper is to propose an alternative to solve permutation-based representation problems with logistics application.</description><subject>Algorithms</subject><subject>Buses (vehicles)</subject><subject>Combinatorial analysis</subject><subject>Logistics</subject><subject>Mathematical models</subject><subject>Optimization</subject><subject>Plugs</subject><subject>Representations</subject><issn>2007-1558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNpdTk1LxDAUDILgsu5_CHjxUngvaZvmKItfsKgHPZekfbVZ0mZtUsV_b0BPDgMDw8wwZ2wjAFSBVdVcsF2MR8hoACoNG_b0sgRrrPMuffMp9OR5CjwG_0k8jcRjN4bguV0jX8Ka3PzOT7nhaeJfLo08pnCKPJKnLrkwX7LzwfhIuz_dsre729f9Q3F4vn_c3xyKE5Z1KtDowSqjelIEYGVnsNOZfV9aXdZkhj5bErRoQCOSbgZDQtaABoxUKLfs-nc3n_lYKaZ2crEj781MYY0tNqKqUKCAHL36Fz2GdZnzuxaVLrFGqFH-AN8cWNc</recordid><startdate>20160101</startdate><enddate>20160101</enddate><creator>Pérez-Rodríguez, Ricardo</creator><creator>Hernández-Aguirre, Arturo</creator><general>International Journal of Combinatorial Optimization Problems & Informatics</general><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>CLZPN</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20160101</creationdate><title>Probability model to solve the school bus routing problem with stops selection</title><author>Pérez-Rodríguez, Ricardo ; Hernández-Aguirre, Arturo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p146t-1a9fb7a7de7e00b3ca1c91c9dd4b946eafdca1309280911e98fae23601a0a3713</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Buses (vehicles)</topic><topic>Combinatorial analysis</topic><topic>Logistics</topic><topic>Mathematical models</topic><topic>Optimization</topic><topic>Plugs</topic><topic>Representations</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Pérez-Rodríguez, Ricardo</creatorcontrib><creatorcontrib>Hernández-Aguirre, Arturo</creatorcontrib><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>Latin America & Iberia Database</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</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>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>International Journal of Combinatorial Optimization Problems and Informatics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Pérez-Rodríguez, Ricardo</au><au>Hernández-Aguirre, Arturo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Probability model to solve the school bus routing problem with stops selection</atitle><jtitle>International Journal of Combinatorial Optimization Problems and Informatics</jtitle><date>2016-01-01</date><risdate>2016</risdate><volume>7</volume><issue>1</issue><spage>30</spage><epage>39</epage><pages>30-39</pages><eissn>2007-1558</eissn><abstract>This paper describes the use of a new algorithm that solves the school bus routing problem with stops selection. The aim is to reduce the travel time of a set of buses that transport students to a school. The fundamental contribution of the authors is the use of a probability model to describe the feasible solution space distribution and thus to get the best solution. An estimation of distribution algorithm is used to address the combinatorial complexity of the problem statement. Different and better results are obtained with the proposed algorithm against a genetic algorithm. The contribution of this paper is to propose an alternative to solve permutation-based representation problems with logistics application.</abstract><cop>Jiutepec</cop><pub>International Journal of Combinatorial Optimization Problems & Informatics</pub><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2007-1558 |
| ispartof | International Journal of Combinatorial Optimization Problems and Informatics, 2016-01, Vol.7 (1), p.30-39 |
| issn | 2007-1558 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1825512120 |
| source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Algorithms Buses (vehicles) Combinatorial analysis Logistics Mathematical models Optimization Plugs Representations |
| title | Probability model to solve the school bus routing problem with stops selection |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T21%3A22%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Probability%20model%20to%20solve%20the%20school%20bus%20routing%20problem%20with%20stops%20selection&rft.jtitle=International%20Journal%20of%20Combinatorial%20Optimization%20Problems%20and%20Informatics&rft.au=P%C3%A9rez-Rodr%C3%ADguez,%20Ricardo&rft.date=2016-01-01&rft.volume=7&rft.issue=1&rft.spage=30&rft.epage=39&rft.pages=30-39&rft.eissn=2007-1558&rft_id=info:doi/&rft_dat=%3Cproquest%3E1825512120%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1794161061&rft_id=info:pmid/&rfr_iscdi=true |