<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <nonSort>A </nonSort>
    <title>genetic algorithm for a location-routing problem</title>
  </titleInfo>
  <name type="personal">
    <namePart>Pornthipa Ongkunaruk</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Anulark Pinnoi</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Shanker, Kripa</namePart>
    <role>
      <roleTerm type="text">Examination committee</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Nagarur, Nagendra N.</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>Royal Thai Government</namePart>
    <role>
      <roleTerm type="text">Scholarship donor</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">series</genre>
  <genre authority="marc">technical report</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">th</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Bangkok</placeTerm>
    </place>
    <publisher>Asian Institute of Technology</publisher>
    <dateIssued>1999</dateIssued>
    <issuance>continuing</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <extent>65 p.: ill.</extent>
  </physicalDescription>
  <abstract>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.</abstract>
  <note>A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science, School of Advanced Technologies</note>
  <note>Thesis (M.Sc.) - Asian Institute of Technology</note>
  <subject authority="lcsh">
    <topic>Genetic algorithms</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Motor vehicles</topic>
    <topic>Automatic location systems</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Thesis ; no. ISE-99-47</title>
    </titleInfo>
    <name type="corporate">
      <namePart>Asian Institute of Technology.</namePart>
      <namePart/>
    </name>
  </relatedItem>
  <identifier type="uri">http://203.159.5.9/ait-thesis/detail.php?q=B12419</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B12419</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">240400</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260818115024.0</recordChangeDate>
  </recordInfo>
</mods>
