<?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>
    <title>Computer scheduling of gasoline deliveries from one depot to a number of delivery points</title>
  </titleInfo>
  <name type="personal">
    <namePart>Suchada Jirakraisri</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Oudheusden, Dirk L. van</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Shrestha, Ram M.</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Bohez, Erik L.J.</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>The Royal Government of the Netherlands</namePart>
    <role>
      <roleTerm type="text">Scholarship Donor</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">th</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Bangkok</placeTerm>
    </place>
    <publisher>Asian Institute of Technology</publisher>
    <dateIssued>1992</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>39, A-62 leaves</extent>
  </physicalDescription>
  <abstract>The study is concerned with the optimum routing and scheduling of a fleet of gasoline  delivery trucks between a central depot and a large number of service stations supplied by the  depot. The travel time between any two points in the system is assumed given and a total quantity  demand for products and a delivery acceptance period are specified for a number of stations within  the distribution system.  There are two types of time windows that have to be considered. One is according to the  specified delivery acceptance period of stations and the other is due to travel regulations of trucks.  They can travel only in specific periods.  It is desired to find a way to assign stations to trucks in such a manner that station  demands are satisfied within the delivery acceptance period and total time covered by the fleet is a  minimum. Additional constraint of travel regulations on trucks may not be violated. A procedure  based on a heuristic algorithm is given for obtaining a near optimal solution.</abstract>
  <note>A thesis submitted in partial fulfillment of the requirements for the degree of Master of  Engineering, School of Engineering and Technology</note>
  <note>Thesis (M.Eng.) - Asian Institute of Technology, 1992</note>
  <subject authority="lcsh">
    <topic>Scheduling (Management)</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Gasoline</topic>
    <topic>Transportation</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Thesis ; no. IE-92-19</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=B17202</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B17202</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">010798</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260818084622.0</recordChangeDate>
  </recordInfo>
</mods>
