Show simple item record

dc.contributor.authorErkut, E.en_US
dc.contributor.authorAlp, O.en_US
dc.date.accessioned2016-02-08T10:14:27Z
dc.date.available2016-02-08T10:14:27Z
dc.date.issued2007en_US
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/23474
dc.description.abstractWe consider the problem of designating hazardous materials routes in and through a major population center. Initially, we restrict our attention to a minimally connected network (a tree) where we can predict accurately the flows on the network. We formulate the tree design problem as an integer programming problem with an objective of minimizing the total transport risk. Such design problems of moderate size can be solved using commercial solvers. We then develop a simple construction heuristic to expand the solution of the tree design problem by adding road segments. Such additions provide carriers with routing choices, which usually increase risks but reduce costs. The heuristic adds paths incrementally, which allows local authorities to trade off risk and cost. We use the road network of the city of Ravenna, Italy, to demonstrate the solution of our integer programming model and our path-addition heuristic.en_US
dc.language.isoEnglishen_US
dc.source.titleComputers & Operations Researchen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cor.2005.06.007en_US
dc.subjectCost accountingen_US
dc.subjectHeuristic methodsen_US
dc.subjectHighway systemsen_US
dc.subjectInteger programmingen_US
dc.subjectMathematical modelsen_US
dc.subjectPopulation statisticsen_US
dc.subjectProblem solvingen_US
dc.subjectRisk assessmenten_US
dc.subjectModerate sizeen_US
dc.subjectRoad networksen_US
dc.subjectRoutingen_US
dc.subjectShipmentsen_US
dc.subjectHazardous materialsen_US
dc.titleDesigning a road network for hazardous materials shipmentsen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage1389en_US
dc.citation.epage1405en_US
dc.citation.volumeNumber34en_US
dc.citation.issueNumber5en_US
dc.identifier.doi10.1016/j.cor.2005.06.007en_US
dc.publisherElsevieren_US
dc.identifier.eissn1873-765X


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record