An adaptive particle swarm optimization algorithm for a multicommodity distribution network design problem (Record no. 1620)

MARC details
000 -LEADER
fixed length control field 03842nas|a2200409 a 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260817161528.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 110110s2009 th uu|m rtt 0| a1eng d
035 ## - SYSTEM CONTROL NUMBER
System control number .b12088353
099 #9 - LOCAL FREE-TEXT CALL NUMBER (OCLC)
Classification number AIT Thesis no.ISE-09-07
100 0# - MAIN ENTRY--PERSONAL NAME
Personal name Suntaree Sae-huere
245 13 - TITLE STATEMENT
Title An adaptive particle swarm optimization algorithm for a multicommodity distribution network design problem
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Pathum Thani, Thailand :
Name of publisher, distributor, etc. Asian Institute of Technology,
Date of publication, distribution, etc. 2009
300 ## - PHYSICAL DESCRIPTION
Extent 54 p. :
Other physical details ill.
490 1# - SERIES STATEMENT
Series statement Thesis ;
Volume/sequential designation no. ISE-09-07
520 ## - SUMMARY, ETC.
Summary, etc. This thesis studies a multicommodity distribution network design problem (MDNP) in the supply chain that involves locations of plants and distribution centers (DCs), and determining the best strategy to distribute the products in a distribution network. The goal of the model is to select the number, size and the location of plants and DCs in order to minimize the total relevant costs. To be more applicable in the industry, a model is formulated with the distance limitation constraint and the multi-capacity level availability for the facilities to supply each type of the products in each candidate plant and to store group products in each candidate DC. An adaptive Particle Swarm Optimization algorithm is applied to solve the problem.The parameters of particle swarm optimization to be adapted include inertia weight and acceleration constants. The algorithm is evaluated by using the benchmark problems provided by Vinaipanit (2006) and some additional randomly generated test problems. The solutions are compared with the solution from the commercial software package LINGO, GA (Vinaipanit), and GLNPSO without adaptive feature in order to verify the performance of the proposed algorithm. The results show that the proposed algorithm can solve the problem and performs well with the percentage of {u0BCC}{u0BEB}{u04A7}about 1.6 and obtain the better solution than GA in small and medium size. For large size problem, the solution is slightly inferior due to the condition of experiment that is the difference of population and iteration. Moreover, the quality of results from adaptive GLNPSO is better than non adaptive GLNPSO with the same parameters setting and significant level of 0.05.
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
502 ## - DISSERTATION NOTE
Dissertation note Thesis (M.Eng.) - Asian Institute of Technology, 2009
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer algoritms
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Business logistics
General subdivision Mathematical models
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 1# - ADDED ENTRY--PERSONAL NAME
Personal name Gong, Dah Chuan,
Relator term Examination committee
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Royal Thai Goverment Fellowship,
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-09-07
856 ## - ELECTRONIC LOCATION AND ACCESS
Materials specified Full-Text
Uniform Resource Identifier <a href="http://203.159.5.9/ait-thesis/detail.php?q=B03250 ">http://203.159.5.9/ait-thesis/detail.php?q=B03250 </a>
907 ## - LOCAL DATA ELEMENT G, LDG (RLIN)
a .b12088353
b mnait
c u
902 ## - LOCAL DATA ELEMENT B, LDB (RLIN)
a 240401
998 ## - LOCAL CONTROL INFORMATION (RLIN)
Operator's initials, OID (RLIN) 0
Cataloger's initials, CIN (RLIN) 110110
First date, FD (RLIN) m
-- a
-- u
-- 3
962 ## -
-- 000:001:PDF:b1208835:000351:0:0:0:0:0:0
-- Abstract-AIT Thesis no.ISE-09-07
-- n
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 : 30050120700900
CREATED CREATED : 2014-03-20
RECORD Id RECORD # : i12774637
LPATRON LPATRON : 1026326
LCHKIN LCHKIN : 2017-02-15
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 1
-- TOT CHKOUT : 3
-- TOT RENEW : 3
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050160030804
CREATED CREATED : 2016-03-16
RECORD Id RECORD # : i12892257
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-09-07 30050120700900 17/08/2026 3 17/08/2026 22-AIT Thesis (Replacement)
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library Archives 17/08/2026     AIT Thesis no.ISE-09-07 30050160030804 17/08/2026 1 17/08/2026 40-Archives
คัดลอกแล้ว!