Loading…

Multiple Yard Cranes Scheduling Model and Algorithm in the Mixture Storage Block

In order to improve the operating efficiency of mixture storage yard, the problem of multiple yard cranes scheduling (MYCS) must to be solved. The paper develops a multiple yard cranes scheduling MIP model in order to minimize the sum of trucks' waiting cost and yard cranes' moving cost. A...

Full description

Saved in:
Bibliographic Details
Published in:Journal of software 2013-10, Vol.8 (10), p.2495-2495
Main Authors: Zheng, Hongxing, Yu, Kai, Tu, Chuang
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-c195t-e27fb010709c36022532794be299f16238a1ac431f6d7f81ea77fa0627327ec43
cites cdi_FETCH-LOGICAL-c195t-e27fb010709c36022532794be299f16238a1ac431f6d7f81ea77fa0627327ec43
container_end_page 2495
container_issue 10
container_start_page 2495
container_title Journal of software
container_volume 8
creator Zheng, Hongxing
Yu, Kai
Tu, Chuang
description In order to improve the operating efficiency of mixture storage yard, the problem of multiple yard cranes scheduling (MYCS) must to be solved. The paper develops a multiple yard cranes scheduling MIP model in order to minimize the sum of trucks' waiting cost and yard cranes' moving cost. An important feature is that the future has to be taken into account: the interference between two yard cranes, and the priorities of internal and external trucks, and the different arrival time of trucks and other factors. The study proposes an improved genetic algorithm (GA) to solve the MYCS problem and verifies the performance of algorithm by two numerical examples. The experimental results indicate that the proposed scheduling model is superior to the traditional scheduling and the algorithm is practically meaningful. Index Terms-Port container terminal, Mixture storage mode, Multiple yard cranes scheduling, Task allocation, Service sequence, Improved Genetic Algorithm
doi_str_mv 10.4304/jsw.8.10.2495-2502
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1475521551</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1475521551</sourcerecordid><originalsourceid>FETCH-LOGICAL-c195t-e27fb010709c36022532794be299f16238a1ac431f6d7f81ea77fa0627327ec43</originalsourceid><addsrcrecordid>eNpNkE1LAzEQhoMoWKt_wFOOXrYm2WSzOdbiF7QoVEFPIc1O2tR0tya7qP_eXerB08zL-zAwD0KXlEx4Tvj1Nn1NykmfGFciY4KwIzSiUhUZo_Lt-N9-is5S2hJSKMr5CD0vutD6fQD8bmKFZ9HUkPDSbqDqgq_XeNFUELCpKzwN6yb6drPDvsbtBvDCf7ddBLxsm2jWgG9CYz_O0YkzIcHF3xyj17vbl9lDNn-6f5xN55mlSrQZMOlWhBJJlM0LwpjImVR8BUwpRwuWl4Yay3Pqikq6koKR0hlSMNlz0BdjdHW4u4_NZwep1TufLITQP9B0SVMuhWBUCNqj7IDa2KQUwel99DsTfzQletCne326HNKgTw_68l-0umLP</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1475521551</pqid></control><display><type>article</type><title>Multiple Yard Cranes Scheduling Model and Algorithm in the Mixture Storage Block</title><source>Alma/SFX Local Collection</source><creator>Zheng, Hongxing ; Yu, Kai ; Tu, Chuang</creator><creatorcontrib>Zheng, Hongxing ; Yu, Kai ; Tu, Chuang</creatorcontrib><description>In order to improve the operating efficiency of mixture storage yard, the problem of multiple yard cranes scheduling (MYCS) must to be solved. The paper develops a multiple yard cranes scheduling MIP model in order to minimize the sum of trucks' waiting cost and yard cranes' moving cost. An important feature is that the future has to be taken into account: the interference between two yard cranes, and the priorities of internal and external trucks, and the different arrival time of trucks and other factors. The study proposes an improved genetic algorithm (GA) to solve the MYCS problem and verifies the performance of algorithm by two numerical examples. The experimental results indicate that the proposed scheduling model is superior to the traditional scheduling and the algorithm is practically meaningful. Index Terms-Port container terminal, Mixture storage mode, Multiple yard cranes scheduling, Task allocation, Service sequence, Improved Genetic Algorithm</description><identifier>ISSN: 1796-217X</identifier><identifier>EISSN: 1796-217X</identifier><identifier>DOI: 10.4304/jsw.8.10.2495-2502</identifier><language>eng</language><subject>Algorithms</subject><ispartof>Journal of software, 2013-10, Vol.8 (10), p.2495-2495</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c195t-e27fb010709c36022532794be299f16238a1ac431f6d7f81ea77fa0627327ec43</citedby><cites>FETCH-LOGICAL-c195t-e27fb010709c36022532794be299f16238a1ac431f6d7f81ea77fa0627327ec43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Zheng, Hongxing</creatorcontrib><creatorcontrib>Yu, Kai</creatorcontrib><creatorcontrib>Tu, Chuang</creatorcontrib><title>Multiple Yard Cranes Scheduling Model and Algorithm in the Mixture Storage Block</title><title>Journal of software</title><description>In order to improve the operating efficiency of mixture storage yard, the problem of multiple yard cranes scheduling (MYCS) must to be solved. The paper develops a multiple yard cranes scheduling MIP model in order to minimize the sum of trucks' waiting cost and yard cranes' moving cost. An important feature is that the future has to be taken into account: the interference between two yard cranes, and the priorities of internal and external trucks, and the different arrival time of trucks and other factors. The study proposes an improved genetic algorithm (GA) to solve the MYCS problem and verifies the performance of algorithm by two numerical examples. The experimental results indicate that the proposed scheduling model is superior to the traditional scheduling and the algorithm is practically meaningful. Index Terms-Port container terminal, Mixture storage mode, Multiple yard cranes scheduling, Task allocation, Service sequence, Improved Genetic Algorithm</description><subject>Algorithms</subject><issn>1796-217X</issn><issn>1796-217X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNpNkE1LAzEQhoMoWKt_wFOOXrYm2WSzOdbiF7QoVEFPIc1O2tR0tya7qP_eXerB08zL-zAwD0KXlEx4Tvj1Nn1NykmfGFciY4KwIzSiUhUZo_Lt-N9-is5S2hJSKMr5CD0vutD6fQD8bmKFZ9HUkPDSbqDqgq_XeNFUELCpKzwN6yb6drPDvsbtBvDCf7ddBLxsm2jWgG9CYz_O0YkzIcHF3xyj17vbl9lDNn-6f5xN55mlSrQZMOlWhBJJlM0LwpjImVR8BUwpRwuWl4Yay3Pqikq6koKR0hlSMNlz0BdjdHW4u4_NZwep1TufLITQP9B0SVMuhWBUCNqj7IDa2KQUwel99DsTfzQletCne326HNKgTw_68l-0umLP</recordid><startdate>20131001</startdate><enddate>20131001</enddate><creator>Zheng, Hongxing</creator><creator>Yu, Kai</creator><creator>Tu, Chuang</creator><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></search><sort><creationdate>20131001</creationdate><title>Multiple Yard Cranes Scheduling Model and Algorithm in the Mixture Storage Block</title><author>Zheng, Hongxing ; Yu, Kai ; Tu, Chuang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c195t-e27fb010709c36022532794be299f16238a1ac431f6d7f81ea77fa0627327ec43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><toplevel>online_resources</toplevel><creatorcontrib>Zheng, Hongxing</creatorcontrib><creatorcontrib>Yu, Kai</creatorcontrib><creatorcontrib>Tu, Chuang</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; 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><jtitle>Journal of software</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zheng, Hongxing</au><au>Yu, Kai</au><au>Tu, Chuang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multiple Yard Cranes Scheduling Model and Algorithm in the Mixture Storage Block</atitle><jtitle>Journal of software</jtitle><date>2013-10-01</date><risdate>2013</risdate><volume>8</volume><issue>10</issue><spage>2495</spage><epage>2495</epage><pages>2495-2495</pages><issn>1796-217X</issn><eissn>1796-217X</eissn><abstract>In order to improve the operating efficiency of mixture storage yard, the problem of multiple yard cranes scheduling (MYCS) must to be solved. The paper develops a multiple yard cranes scheduling MIP model in order to minimize the sum of trucks' waiting cost and yard cranes' moving cost. An important feature is that the future has to be taken into account: the interference between two yard cranes, and the priorities of internal and external trucks, and the different arrival time of trucks and other factors. The study proposes an improved genetic algorithm (GA) to solve the MYCS problem and verifies the performance of algorithm by two numerical examples. The experimental results indicate that the proposed scheduling model is superior to the traditional scheduling and the algorithm is practically meaningful. Index Terms-Port container terminal, Mixture storage mode, Multiple yard cranes scheduling, Task allocation, Service sequence, Improved Genetic Algorithm</abstract><doi>10.4304/jsw.8.10.2495-2502</doi><tpages>1</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1796-217X
ispartof Journal of software, 2013-10, Vol.8 (10), p.2495-2495
issn 1796-217X
1796-217X
language eng
recordid cdi_proquest_miscellaneous_1475521551
source Alma/SFX Local Collection
subjects Algorithms
title Multiple Yard Cranes Scheduling Model and Algorithm in the Mixture Storage Block
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T17%3A22%3A22IST&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=Multiple%20Yard%20Cranes%20Scheduling%20Model%20and%20Algorithm%20in%20the%20Mixture%20Storage%20Block&rft.jtitle=Journal%20of%20software&rft.au=Zheng,%20Hongxing&rft.date=2013-10-01&rft.volume=8&rft.issue=10&rft.spage=2495&rft.epage=2495&rft.pages=2495-2495&rft.issn=1796-217X&rft.eissn=1796-217X&rft_id=info:doi/10.4304/jsw.8.10.2495-2502&rft_dat=%3Cproquest_cross%3E1475521551%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c195t-e27fb010709c36022532794be299f16238a1ac431f6d7f81ea77fa0627327ec43%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1475521551&rft_id=info:pmid/&rfr_iscdi=true