SCIENCE@home

Simulated annealing algorithm for solving pickup and delivery problem with LIFO, time duration and limited vehicle number

A. Andriansyah,N. Prasanti,H. Sastra

Published 2019 in IOP Conference Series: Materials Science and Engineering

ABSTRACT

Nowadays, the process of delivering goods or documents from one place to another can be done faster by utilizing a courier service. This courier must be able to create a travel route to pick goods and deliver them with a short time. Route creation will be more difficult if there is a time window for each customer and the goods being transported are heavy or dangerous items. In this case, the courier company must implement a last-in-first-out rules. In addition, with the limitation of vehicles number, companies have to minimize the number of underserved customers. This problem called pickup and delivery problem with last-in-first-out, time duration, and limited vehicle number. In this study, to solve the problem, simulated annealing algorithm was used for some dataset. To explore the solution space for the problem, this algorithm will use pair relocation operator. In several experiments, the results show a good solution and short computation time.

PUBLICATION RECORD

  • Publication year

    2019

  • Venue

    IOP Conference Series: Materials Science and Engineering

  • Publication date

    2019-12-30

  • Fields of study

    Physics, Business, Engineering, Computer Science

  • Identifiers
    DOI 10.1088/1757-899X/697/1/012021
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-17 of 17 references · Page 1 of 1

CITED BY

Showing 1-5 of 5 citing papers · Page 1 of 1