Open access
Journal
SINTA 2
Agent-based Truck Appointment System for Containers Pick-up Time Negotiation
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) · Vol. 14 No. 1 (2020) · pp. 81–90
ISSN 2460-7258, 1978-1520
Published 2020-01-31
Publisher IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.
Language eng
Abstract
Congestion in the seaports area is a common issue in many parts of the world. Fluctuating truck arrival has been identified as one of the significant determinants of congestion. In response, a truck appointment system (TAS) is introduced to manage truck arrival, particularly at peak times. In the existing TAS mechanism, the scheduling decision is centralized and disregards the concerns of trucking companies. Moreover, TAS may complicate the business operation of trucking companies that already have a constrained truck schedule. This study proposes a decentralized negotiation mechanism in TAS that allows trucking companies to adjust arrival times by utilizing the waiting time estimation provided by the terminal operator. We develop an agent-based model of a TAS in the container terminal pick-up procedure. The simulation results indicate that compared to the existing TAS mechanism, the negotiation TAS mechanism generates a shorter average truck turnaround time regardless of truck arrival rates. In terms of average net time cost, the negotiation TAS mechanism provides better value under high truck arrival rate conditions. The incentive for trucking companies to participate in the negotiations is even higher at peak times.
Collaboration network of the authors
11 authors ·
20 co-authorship links
Hover or tap a name to highlight its co-authors. Double-click to open the author's page.
Bandung Institute of Technology Affiliation unknown
Different organisations
Same organisation
Affiliation unknown
Thicker line = more joint articles · bigger circle = more articles
Show as table
Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.
Metadata source: OAI-PMH (metadata jurnal) https://journal.ugm.ac.id/ijccs/oai, first harvested 26 Oct 2026, last seen 8 Nov 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="en-US">Agent-based Truck Appointment System for Containers Pick-up Time Negotiation</dc:title>
<dc:creator>Ramadhan, Fakhri Ihsan</dc:creator>
<dc:creator>Wasesa, Meditya</dc:creator>
<dc:subject xml:lang="en-US">Operations Management</dc:subject>
<dc:subject xml:lang="en-US">Truck Appointment System; Negotiation; Agent-based Modelling; Simulation; Container Terminal Operation</dc:subject>
<dc:description xml:lang="en-US">Congestion in the seaports area is a common issue in many parts of the world. Fluctuating truck arrival has been identified as one of the significant determinants of congestion. In response, a truck appointment system (TAS) is introduced to manage truck arrival, particularly at peak times. In the existing TAS mechanism, the scheduling decision is centralized and disregards the concerns of trucking companies. Moreover, TAS may complicate the business operation of trucking companies that already have a constrained truck schedule. This study proposes a decentralized negotiation mechanism in TAS that allows trucking companies to adjust arrival times by utilizing the waiting time estimation provided by the terminal operator. We develop an agent-based model of a TAS in the container terminal pick-up procedure. The simulation results indicate that compared to the existing TAS mechanism, the negotiation TAS mechanism generates a shorter average truck turnaround time regardless of truck arrival rates. In terms of average net time cost, the negotiation TAS mechanism provides better value under high truck arrival rate conditions. The incentive for trucking companies to participate in the negotiations is even higher at peak times.</dc:description>
<dc:publisher xml:lang="en-US">IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.</dc:publisher>
<dc:contributor xml:lang="en-US"></dc:contributor>
<dc:date>2020-01-31</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
<dc:type xml:lang="en-US"></dc:type>
<dc:format>application/pdf</dc:format>
<dc:identifier>https://journal.ugm.ac.id/ijccs/article/view/51274</dc:identifier>
<dc:identifier>10.22146/ijccs.51274</dc:identifier>
<dc:source xml:lang="en-US">IJCCS (Indonesian Journal of Computing and Cybernetics Systems); Vol 14, No 1 (2020): January; 81-90</dc:source>
<dc:source>2460-7258</dc:source>
<dc:source>1978-1520</dc:source>
<dc:language>eng</dc:language>
<dc:relation>https://journal.ugm.ac.id/ijccs/article/view/51274/26963</dc:relation>
<dc:rights xml:lang="en-US">Copyright (c) 2020 IJCCS (Indonesian Journal of Computing and Cybernetics Systems)</dc:rights>
<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>
Citations and indexing
OpenAlex
Indexed
via DOI
7 citations
Crossref
Indexed
via DOI
4 citations
Counts as reported by each index on 26 Oct 2026; indexes count citations differently.
OpenAlex also lists this work in: crossref, doaj.
Cite this article
APA 7
Ramadhan, F. I., & Wasesa, M. (2020). Agent-based Truck Appointment System for Containers Pick-up Time Negotiation. IJCCS (Indonesian Journal of Computing and Cybernetics Systems), 14(1), 81–90. https://doi.org/10.22146/ijccs.51274
Copy
IEEE
F. I. Ramadhan and M. Wasesa, “Agent-based Truck Appointment System for Containers Pick-up Time Negotiation,” IJCCS (Indonesian Journal of Computing and Cybernetics Systems), vol. 14, no. 1, pp. 81–90, 2020, doi: 10.22146/ijccs.51274.
Copy
Generated from the journal's metadata; check author names before use.