A Transportation Scheduling Algorithm.

Date of Submission

December 2016

Date of Award

Winter 12-12-2017

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science

Department

Advance Computing and Microelectronics Unit (ACMU-Kolkata)

Supervisor

Das, Sandip (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

Suppose there are pick-ups and drops along a line. Each pick-up has weight to be transported to its corresponding drop. A carriage with a finite capacity is assigned to carry out this transportation job. Our objective is to find out the traversal route for the carriage for which the distance traversed by the carriage is minimum. Here we have tried to find out algorithms which can serve our objective

Comments

ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843275

Control Number

ISI-DISS-2016-346

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

DOI

http://dspace.isical.ac.in:8080/jspui/handle/10263/6503

This document is currently not available here.

Share

COinS