Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitemtc-m16b.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Repositorydpi.inpe.br/ce@80/2007/01.23.04.00   (restricted access)
Last Update2007:04.09.20.56.30 (UTC) administrator
Metadata Repositorydpi.inpe.br/ce@80/2007/01.23.04.00.47
Metadata Last Update2018:06.05.03.33.48 (UTC) administrator
Citation KeyChouLin:2007:MuViRo
TitleMuseum Visitor Routing Problem with the Balancing of Concurrent Visitors
FormatPrint; CD-ROM; On-line.
Year2007
Access Date2024, Apr. 27
Secondary TypeCI
Number of Files3
Size1208 KiB
2. Context
Author1 Chou, Shuo-Yan
2 Lin, Shih-Wei
Affiliation1 National Taiwan University of Science & Technology
2 Huafan University
Author e-Mail Address1 sychou@im.ntust.edu.tw
2 swlin@cc.hfu.edu.tw
EditorLoureiro, Geilson
Curran, Ricky
e-Mail Addresssychou@im.ntust.edu.tw
Conference NameISPE International Conference on Concurrent Engineering, 14 (CE 2007).
Conference LocationSão Jos¡§¦ dos Campos
Date2007, July 16-20
PublisherInstituto Nacional de Pesquisas Espaciais (INPE)
Publisher CitySão José dos Campos
Pages335-343
Book TitleProceedings
OrganizationInstituto Nacional de Pesquisas Espaciais (INPE)
History (UTC)2007-02-28 14:44:02 :: sychou@im.ntust.edu.tw -> ce2007 ::
2007-03-29 12:42:13 :: ce2007 -> sychou@im.ntust.edu.tw ::
2007-04-09 10:07:16 :: sychou@im.ntust.edu.tw -> ce2007 ::
2007-04-12 21:44:13 :: ce2007 -> administrator ::
2007-05-18 15:21:48 :: administrator -> ce2007 ::
2007-05-21 19:34:35 :: ce2007 -> administrator ::
2018-06-05 03:33:48 :: administrator -> marciana :: 2007
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Keywordsrouting problem
vehicle routing
multiple routing.
museum visitor routing problem
AbstractIn the museum visitor routing problem, each visitor has some exhibits of interest. The visiting route requires going through all the locations of the exhibits that he/she wants to visit. Routes need to be scheduled based on certain criteria to avoid congestion and/or prolonged touring time. In this study, museum visitor routing problems (MVRPs) are formulated by mixed integer programming and can be solved as open shop scheduling (OSS) problems. While visitors can be viewed as jobs, exhibits are like machines. Each visitor would view an exhibit for a certain amount of time, which is analogous to the processing time required for each job at a particular machine. The traveling distance from one exhibit to another can be modeled as the setup time at a machine. It is clear that such setup time is sequence dependent which are not considered in OSS problems. Therefore, this kind of routing problem is an extension of OSS problems. Due to the intrinsic complexity of this kind of problems, that is NP-hard, a simulated annealing approach is proposed to solve MVRPs. The computational results show that the proposed approach solves the MVRPS with a reasonable amount of computational time.
AreaETES
TypeManufacturing processes and environmental requirements for sustainability
doc Directory Contentaccess
source Directory Content
doc.zip 28/02/2007 02:58 1.5 MiB
Museum Visitor Routing Problem CE 2007.pdf 28/02/2007 11:44 199.9 KiB 
agreement Directory Contentthere are no files
4. Conditions of access and use
Languageen
Target Filepaper.pdf
User Groupadministrator
sychou@im.ntust.edu.tw
administrator
Visibilityshown
Read Permissiondeny from all and allow from 150.163
5. Allied materials
Host Collectionlcp.inpe.br/ignes/2004/02.12.18.39
cptec.inpe.br/walmeida/2003/04.25.17.12
6. Notes
Mark1
Empty Fieldsarchivingpolicy archivist callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage doi edition group identifier isbn issn label lineage mirrorrepository nextedition nexthigherunit notes numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark serieseditor shorttitle sponsor tertiarymark tertiarytype url versiontype volume
7. Description control
e-Mail (login)marciana
update 


Close