Simulation of a Regional Scheduling Problem

Benjamin Lev and Eugene Kwatny
Additional contact information
Benjamin Lev: Department of Management, Worcester Polytechnic Institute, Worcester, Massachusetts 01609
Eugene Kwatny: Department of Computer and Information Sciences, College of Engineering, Computer Science, and Architecture, Temple University, Philadelphia, Pennsylvania 19122

Interfaces, 1988, vol. 18, issue 2, 28-37

Abstract: A large corporate client of Rosenbluth Travel Agency conducts several foreign trips every year which include scientists and business persons. During their tours, each group is supposed to visit as many as 60 different companies located in about 20 different cities. Each meeting is to be attended by a business person and a scientist. Some meetings require the attendance of a specific individual while some allow any scientist or business person. Our objective was to determine a feasible tour with the minimum number of repeat visits. We developed a computer program that uses heuristics to solve the problem.

Keywords: industries: travel; programming; integer: algorithm; heuristic (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/inte.18.2.28 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orinte:v:18:y:1988:i:2:p:28-37

Access Statistics for this article

More articles in Interfaces from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().