PropertyValue
?:abstract
  • Computing the shortest path to pick up items existing in a shopping list is a principle function for an indoor intelligent navigation system dedicated to customers inside hypermarkets. In this paper, we introduce an optimization approach based on tabu search to compute the route visiting all items in the list. We consider that the list contains some promotional items with time windows. ()
?:appearsInConferenceInstance
?:appearsInConferenceSeries
?:bookTitle
  • SMC ()
?:citationCount
  • 0 ()
?:cites
?:created
  • 2016-06-24 ()
?:creator
?:doi
  • 10.1109/ICSMC.2011.6083861 ()
?:endingPage
  • 1204 ()
?:estimatedCitationCount
  • 0 ()
?:hasDiscipline
?:hasURL
?:language
  • en ()
?:publicationDate
  • 2011-10-01 ()
?:publisher
  • IEEE ()
?:rank
  • 22889 ()
?:referenceCount
  • 13 ()
?:startingPage
  • 1199 ()
?:title
  • Itinerary optimisation approach with time windows inside hypermarkets ()
?:type

Metadata

Anon_0  
expand all