A genetic algorithm for a location-routing problem (Record no. 49419)

MARC details
000 -LEADER
fixed length control field 03064nas|a2200397 i 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260818115024.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 240400s1999 th uzm rtt 00| a1eng d
035 ## - SYSTEM CONTROL NUMBER
System control number .b11786292
099 #9 - LOCAL FREE-TEXT CALL NUMBER (OCLC)
Classification number AIT Thesis no.ISE-99-47
100 0# - MAIN ENTRY--PERSONAL NAME
Personal name Pornthipa Ongkunaruk
245 12 - TITLE STATEMENT
Title A genetic algorithm for a location-routing problem
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Bangkok :
Name of publisher, distributor, etc. Asian Institute of Technology,
Date of publication, distribution, etc. 1999
300 ## - PHYSICAL DESCRIPTION
Extent 65 p.:
Other physical details ill.
490 1# - SERIES STATEMENT
Series statement Thesis ;
Volume/sequential designation no. ISE-99-47
502 ## - DISSERTATION NOTE
Dissertation note Thesis (M.Sc.) - Asian Institute of Technology
500 ## - GENERAL NOTE
General note A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science, School of Advanced Technologies
520 ## - SUMMARY, ETC.
Summary, etc. In distribution system, the strategic and tactical decisions of the locations of depots and the routes of allocated customers are addressed in Location-Routing Problem. Since the traditional optimization method takes a long computational time to solve the problem. An alternative method, a genetic algorithm is proposed in this study. Firstly, the permutation encoding and decoding interpret solutions as clustering and routing simultaneously. Secondly, the initialization procedure originates feasible solutions. Then, the combined roulette wheel and rank selection chooses two parents to crossover by a new technique called group crossover. It saves the fixed and variable costs and generates feasible offspring. After crossover, the swap mutation is also applied. Subsequently, the algorithms are written in C++ program. The GA performance is evaluated by the experiment varying problem sizes and comparing the results with those of optimization package called CPLEX. The values of GA parameters are also studied for their effects on the quality of solutions. It is found that their appropriate values depend on the problem sizes. In general, GA performs well as it generates heuristic solutions with a less computational time compared with that of CPLEX. Moreover, GA can find solutions in large problems that CPLEX cannot solve in a limited time.
650 10 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Genetic algorithms
650 10 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Motor vehicles
General subdivision Automatic location systems
700 0# - ADDED ENTRY--PERSONAL NAME
Personal name Anulark Pinnoi,
Relator term Chairperson
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Shanker, Kripa,
Relator term Examination committee
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Nagarur, Nagendra N.,
Relator term Examination Committee
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Royal Thai Government,
Relator term Scholarship donor
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-99-47
856 ## - ELECTRONIC LOCATION AND ACCESS
Materials specified Full-Text
Uniform Resource Identifier <a href="http://203.159.5.9/ait-thesis/detail.php?q=B12419">http://203.159.5.9/ait-thesis/detail.php?q=B12419</a>
907 ## - LOCAL DATA ELEMENT G, LDG (RLIN)
a .b11786292
b mnait
c u
902 ## - LOCAL DATA ELEMENT B, LDB (RLIN)
a 240330
998 ## - LOCAL CONTROL INFORMATION (RLIN)
Operator's initials, OID (RLIN) 0
Cataloger's initials, CIN (RLIN) 000424
First date, FD (RLIN) m
-- a
-- u
-- 2
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnait
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnarc
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 22-AIT Thesis (Replacement)
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 40-Archives
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050120814008
CREATED CREATED : 2014-03-31
RECORD Id RECORD # : i12782749
LPATRON LPATRON : 1025965
LCHKIN LCHKIN : 2016-05-28
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 2
-- TOT RENEW : 9
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050160099775
CREATED CREATED : 2016-04-27
RECORD Id RECORD # : i12958347
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 18/08/2026 50.00   AIT Thesis no.ISE-99-47 30050120814008 18/08/2026 3 18/08/2026 22-AIT Thesis (Replacement)
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library Archives 18/08/2026     AIT Thesis no.ISE-99-47 30050160099775 18/08/2026 1 18/08/2026 40-Archives
คัดลอกแล้ว!