Research on ship in and out scheduling under linear constraint of meeting delay
Ship in and out scheduling is an important issue and complex problem for harbor traffic organization. In this paper, based on the safety distance model for meeting, the objective function of ship arrival and departure scheduling is constructed, and the linear constraint condition and its analytical...
Saved in:
Published in | 2021 6th International Symposium on Computer and Information Processing Technology (ISCIPT) pp. 736 - 739 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.06.2021
|
Subjects | |
Online Access | Get full text |
DOI | 10.1109/ISCIPT53667.2021.00155 |
Cover
Loading…
Abstract | Ship in and out scheduling is an important issue and complex problem for harbor traffic organization. In this paper, based on the safety distance model for meeting, the objective function of ship arrival and departure scheduling is constructed, and the linear constraint condition and its analytical formula of the encounter delay are obtained. Inspired by the traveling salesman problem, the GA-PS algorithm is proposed to solve the ship arrival and departure scheduling plan. The feasibility and effectiveness of GA-PS algorithm are verified by the actual port data. The in and out plan of port traffic has been calculated. The verification result illustrates that the GA-PS algorithm can solve the ship scheduling problem with linear constraint. |
---|---|
AbstractList | Ship in and out scheduling is an important issue and complex problem for harbor traffic organization. In this paper, based on the safety distance model for meeting, the objective function of ship arrival and departure scheduling is constructed, and the linear constraint condition and its analytical formula of the encounter delay are obtained. Inspired by the traveling salesman problem, the GA-PS algorithm is proposed to solve the ship arrival and departure scheduling plan. The feasibility and effectiveness of GA-PS algorithm are verified by the actual port data. The in and out plan of port traffic has been calculated. The verification result illustrates that the GA-PS algorithm can solve the ship scheduling problem with linear constraint. |
Author | Zhang, Yingjun Zhang, Jie |
Author_xml | – sequence: 1 givenname: Jie surname: Zhang fullname: Zhang, Jie email: ajay80508@dlmu.edu.cn organization: Navigation college Dalian Maritime University,Dalian,Liaoning,China – sequence: 2 givenname: Yingjun surname: Zhang fullname: Zhang, Yingjun email: zjdlmu@163.com organization: Navigation college Dalian Maritime University,Dalian,Liaoning,China |
BookMark | eNotjN1KwzAYQCPohc49gSB5gdZ8-W0vpfhTGEx0Xo80-WIDXTrS9mJv78RdnXNxOHfkOo0JCXkEVgKw-qn9atqPnRJam5IzDiVjoNQVWdemAq2VlCCMuSXbT5zQZtfTMdGpj0caE7XJ03GZ6eR69MsQ0w9dksdMz3qOqRvTNGcb00zHQA-I81_icbCne3IT7DDh-sIV-X592TXvxWb71jbPmyICVHOhUQXuwXIJAR12tQLrq07XglfaICohuXCopeDBWe87ZpwNWirppcDOixV5-P9GRNwfczzYfNrXWkrFufgFbEZOPg |
CODEN | IEEPAD |
ContentType | Conference Proceeding |
DBID | 6IE 6IL CBEJK RIE RIL |
DOI | 10.1109/ISCIPT53667.2021.00155 |
DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
EISBN | 9781665441377 1665441372 |
EndPage | 739 |
ExternalDocumentID | 9644522 |
Genre | orig-research |
GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 51679025 funderid: 10.13039/501100001809 |
GroupedDBID | 6IE 6IL CBEJK RIE RIL |
ID | FETCH-LOGICAL-i118t-6e5f2d1a241feceb951ad8b6932867ee53423ce6432fcaddb07caf6454d43ebd3 |
IEDL.DBID | RIE |
IngestDate | Thu Jun 29 18:37:53 EDT 2023 |
IsPeerReviewed | false |
IsScholarly | false |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-i118t-6e5f2d1a241feceb951ad8b6932867ee53423ce6432fcaddb07caf6454d43ebd3 |
PageCount | 4 |
ParticipantIDs | ieee_primary_9644522 |
PublicationCentury | 2000 |
PublicationDate | 2021-June |
PublicationDateYYYYMMDD | 2021-06-01 |
PublicationDate_xml | – month: 06 year: 2021 text: 2021-June |
PublicationDecade | 2020 |
PublicationTitle | 2021 6th International Symposium on Computer and Information Processing Technology (ISCIPT) |
PublicationTitleAbbrev | ISCIPT |
PublicationYear | 2021 |
Publisher | IEEE |
Publisher_xml | – name: IEEE |
Score | 1.7693092 |
Snippet | Ship in and out scheduling is an important issue and complex problem for harbor traffic organization. In this paper, based on the safety distance model for... |
SourceID | ieee |
SourceType | Publisher |
StartPage | 736 |
SubjectTerms | Analytical models Delay effects Delays encounter delay GA-PS linear constraint condition Linear programming Organizations Scheduling ship scheme for approaching harbor Traveling salesman problems |
Title | Research on ship in and out scheduling under linear constraint of meeting delay |
URI | https://ieeexplore.ieee.org/document/9644522 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1NS8NAEF3anjyptOI3e_Bo0iS72STnYmmFasEWeiv7MYEiJlKSg_56Z5K2onjwtuSyyyzkvUnee8PYnTBWGgngKaHAk2CNZ5Blew7SCNkGJIEhN_LsSU2W8nEVrzrs_uCFAYBGfAY-LZt_-a60NX0qG2YI3sgXuqyLjVvr1dqZfsMgG05fRtP5IhZKJdj3RaHf8IEfU1Ma0Bgfs9l-u1Yr8urXlfHt568kxv-e54QNvu15fH4AnlPWgaLPnvcaOl4WnCRYfFNwXThe1hXHFhYhhZznnExjW07kUm-5JXZIQyIqXub8DRr_M6fgyI8BW44fFqOJt5uW4G2wSag8BXEeuVAjJOdgwSB10i41CglaqhKAmLL-LCADiXKLbzUTJFbnFOjlpADjxBnrFWUB54xDmEmno1xaI2QeKBPoOHaxDDOKkxPigvWpGOv3NhBjvavD5d-Pr9gRXUerr7pmvWpbww0ieWVumyv8AjNNoWE |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1NT8JAFNwgHvSkBozf7sGjLW33o_RMJKCAJELCjezHa0KMrSHtQX-9-1rAaDx4a_bSzW6yM293Zh4hd0wbrjmAJ5kEj4PRnnYs27PQjRzbgDjQ6EYeT-Rgzh8XYtEg9zsvDABU4jPw8bN6y7e5KfGqrJM48HZ8YY_sCzTj1m6tje03DJLO8KU3nM4EkzJ2lV8U-hUj-NE3pYKN_hEZb39Yq0Ve_bLQvvn8lcX43xkdk_a3QY9Od9BzQhqQtcjzVkVH84yiCIuuMqoyS_OyoK6IdaCC3nOKtrE1RXqp1tQgP8Q2EQXNU_oGlQOaYnTkR5vM-w-z3sDb9EvwVq5MKDwJIo1sqBwop2BAO_KkbFdLR9G6MgYQmPZnwHGQKDXuXNNBbFSKkV6WM9CWnZJmlmdwRiiECbcqSrnRjKeB1IESwgoeJhgox9g5aeFiLN_rSIzlZh0u_h6-JQeD2Xi0HA0nT5fkELemVltdkWaxLuHa4Xqhb6rt_ALMcqSp |
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%3Abook&rft.genre=proceeding&rft.title=2021+6th+International+Symposium+on+Computer+and+Information+Processing+Technology+%28ISCIPT%29&rft.atitle=Research+on+ship+in+and+out+scheduling+under+linear+constraint+of+meeting+delay&rft.au=Zhang%2C+Jie&rft.au=Zhang%2C+Yingjun&rft.date=2021-06-01&rft.pub=IEEE&rft.spage=736&rft.epage=739&rft_id=info:doi/10.1109%2FISCIPT53667.2021.00155&rft.externalDocID=9644522 |