cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Yusram, S.Pd., M.Pd
Contact Email
journal.lamintang@gmail.com
Phone
+6281268339633
Journal Mail Official
ijai.lamintang@gmail.com
Editorial Address
Building of LET Centre. Buana Impian, Blok B1 No. 27. Kota Batam 29452, KEPRI. Indonesia - Location = Kota Batam, Kepulauan Riau INDONESIA.
Location
Kota batam,
Kepulauan riau
INDONESIA
International Journal of Artificial Intelligence
Published by Lamintang Education & Training Centre
ISSN : 24077275     EISSN : 26863251     DOI : https://doi.org/10.36079/lamintang.ijai
Core Subject : Science,
Computer Science & IT Decision Sciences, Operations Research & Management
The aim is to publish high-quality articles dedicated to Artificial Intelligence. IJAI published in biannual, and in Indonesian, Malay and English.
Arjuna Subject : -
Articles 1 Documents
 1 
Search results for , issue "Vol 1 No 1 (2014)" : 1 Documents clear
Solving Rich Vehicle Routing Problem Using Three Steps Heuristic Mohd. Sapiyan Baba; Ismail Yusuf Panessai; Nur Iksan
International Journal of Artificial Intelligence Vol 1 No 1 (2014)
Publisher : Lamintang Education and Training Centre, in collaboration with the International Association of Educators, Scientists, Technologists, and Engineers (IA-ESTE)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36079/lamintang.ijai-0101.9

Abstract

Vehicle Routing Problem (VRP) relates to the problem of providing optimum service with a fleet of vehicles to customers. It is a combinatorial optimization problem. The objective is usually to maximize the profit of the operation. However, for public transportation owned and operated by government, accessibility takes priority over profitability. Accessibility usually reduces profit, while increasing profit tends to reduce accessibility. In this research, we look at how accessibility can be increased without penalizing the profitability. This requires the determination of routes with minimum fuel consumption, maximum number of ports of call and maximum load factor satisfying a number of pre-determined constraints: hard and soft constraints. To solve this problem, we propose a heuristic algorithm. The results from this experiment show that the algorithm proposed has better performance compared to the partitioning set.

Page 1 of 1 | Total Record : 1

 1 

Filter by Year

2014 2014


Reset
Filter By Issues
All Issue Vol 12 No 1: June 2025 Vol 11 No 2: December 2024 Vol 11 No 1: June 2024 Vol 10 No 2: December 2023 Vol 10 No 1: June 2023 Vol 9 No 2: December 2022 Vol 9 No 1: June 2022 Vol 8 No 2: December 2021 Vol 8 No 1 (2021) Vol 7 No 2 (2020) Vol 7 No 1 (2020) Vol 6 No 2 (2019) Vol 6 No 1 (2019) Vol 1 No 1 (2014) More Issue