Adaptive variable neighborhood search algorithms for solving capacitated vehicle routing problems (Record no. 1640)

MARC details
000 -LEADER
fixed length control field 03347nam a2200421 a 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260817161532.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 140625s2012 th ad ||| |000 0 eng d
035 ## - SYSTEM CONTROL NUMBER
System control number .b12135859
099 #9 - LOCAL FREE-TEXT CALL NUMBER (OCLC)
Classification number AIT Thesis no.ISE-12-51
100 0# - MAIN ENTRY--PERSONAL NAME
Personal name Sikarin Vinyoopradit
245 10 - TITLE STATEMENT
Title Adaptive variable neighborhood search algorithms for solving capacitated vehicle routing problems
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Pathum Thani :
Name of publisher, distributor, etc. Asian Institute of Technology,
Date of publication, distribution, etc. 2012
300 ## - PHYSICAL DESCRIPTION
Extent 104 p. :
Other physical details ill. (some col.), charts
490 1# - SERIES STATEMENT
Series statement Thesis ;
Volume/sequential designation no. ISE-12-51
500 ## - GENERAL NOTE
General note Submitted in partial fulfillment of the requirements for the degree of Master of Engineering in Industrial and Manufacturing Engineering, School of Engineering and Technology
520 ## - SUMMARY, ETC.
Summary, etc. This research presents adaptive variable neighborhood search algorithms for solving Capacitated Vehicle Routing Problems (CVRP). Four Variable Neighborhood Search (VNS) based algorithms to optimize Capacitated Vehicle Routing Problems (CVRP) are studied. The first algorithm is a Variable Neighborhood Search (VNS) integrated with Tabu Search (TS) implemented with new proposed Tabu List. The second algorithm is an Adaptive Variable Neighborhood Search (AVNS) algorithm to improve the perturbation process of VNS algorithm by allowing the frequently used sequences in local optimum to be selected via integrating Roulette Wheel Selection method. The third algorithm is an alternative AVNS algorithm that adopts approach similar to Ant Colony Optimization (ACO) to the AVNS algorithm called A-AVNS1 to reduce the influence of the infrequent used sequences. An Adaptive Roulette Wheel Selection method is proposed in A-AVNS2 algorithm to improve algorithm exploration efficiency. Numerical experiments are carried out using the published benchmark test problems. The results indicated that the proposed adaptive VNS algorithms improved solution quality and solution time for large problem sizes.
502 ## - DISSERTATION NOTE
Dissertation note Thesis (M. Eng.) - Asian Institute of Technology, 2012
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Vehicle routing problem
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms
700 0# - ADDED ENTRY--PERSONAL NAME
Personal name Voratas Kachitvichyanukul,
Relator term Chairperson
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Huynh, Trung Luong,
Relator term Examination Committee
700 0# - ADDED ENTRY--PERSONAL NAME
Personal name Pisut Koomsap,
Relator term Examination Committee
810 2# - SERIES ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Asian Institute of Technology.
Title of a work Thesis ;
Volume/sequential designation no. ISE-12-51
856 ## - ELECTRONIC LOCATION AND ACCESS
Materials specified Full-Text
Uniform Resource Identifier <a href="http://203.159.5.9/ait-thesis/detail.php?q=B03378 ">http://203.159.5.9/ait-thesis/detail.php?q=B03378 </a>
907 ## - LOCAL DATA ELEMENT G, LDG (RLIN)
a .b12135859
b mnait
c j
902 ## - LOCAL DATA ELEMENT B, LDB (RLIN)
a 251123
998 ## - LOCAL CONTROL INFORMATION (RLIN)
Operator's initials, OID (RLIN) 0
Cataloger's initials, CIN (RLIN) 140625
First date, FD (RLIN) m
-- a
-- j
-- 0
962 ## -
-- 000:001:PDF:b1213585:001752:0:0:0:0:0:0
-- Abstract--AIT Thesis no.ISE-12-51
-- n
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnait
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnait
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnarc
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 20-AIT Publication
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 40-Archives
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050120844765
CREATED CREATED : 2014-09-07
RECORD Id RECORD # : i1281765x
LPATRON LPATRON : 0
LCHKIN LCHKIN : -
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 1
-- TOT CHKOUT : 0
-- TOT RENEW : 0
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050120844757
CREATED CREATED : 2014-09-07
RECORD Id RECORD # : i12817661
LPATRON LPATRON : 0
LCHKIN LCHKIN : -
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 0
-- TOT RENEW : 0
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050160028816
CREATED CREATED : 2016-03-17
RECORD Id RECORD # : i1289400x
LPATRON LPATRON : 0
LCHKIN LCHKIN : -
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 0
-- TOT RENEW : 0
Holdings
Withdrawn status Lost status Damaged status Not for loan Home library Current library Shelving location Date acquired Cost, normal purchase price Total checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library AIT Publications 17/08/2026 50.00   AIT Thesis no.ISE-12-51 30050120844765 17/08/2026 1 17/08/2026 20-AIT Publication
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library AIT Publications 17/08/2026 50.00   AIT Thesis no.ISE-12-51 30050120844757 17/08/2026 2 17/08/2026 20-AIT Publication
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library Archives 17/08/2026     AIT Thesis no.ISE-12-51 30050160028816 17/08/2026 1 17/08/2026 40-Archives
คัดลอกแล้ว!