Web-Books
in the Austria-Forum
Austria-Forum
Web-Books
Informatik
Algorithms for Scheduling Problems
Page - 131 -
  • User
  • Version
    • full version
    • text only version
  • Language
    • Deutsch - German
    • English

Page - 131 - in Algorithms for Scheduling Problems

Image of the Page - 131 -

Image of the Page - 131 - in Algorithms for Scheduling Problems

Text of the Page - 131 -

Algorithms 2018,11, 54 accordinglywhentravellersbehaveboundedlyrational.DiandLiu[32]presentedacomprehensive reviewofmodelsaswellasmethodologiesofboundedrationalityroutechoicebehavior. Themodels aremainlydivided into twoparts: substantiveandproceduralboundedrationalitymodels.While methodologies appliedon these twomodels aregame theoryand interactive congestiongame for substantiveboundedrationality,andrandomutilityandnon-orsemi-compensatoryforprocedural boundedrationality. 3.MathematicalModelFormulation Thepresentresearchinvestigatestheoperationspolicyofamulti-nationalfirmwhichmakesgoods forservinggeographicallydisjointedmarketswith localizedfinalassembliesand jointparts. The joint partcanbeshippedfromthemarketswithdiversefinancialanddemandfeatures. Thecostrequiredfor transferringthe jointcomponents (intermediategoodsbetweenmarkets),andfor foreigntradebarriers like tariffs andduties provides the total transportation cost. The generalized operations strategy structure is illustrated inFigure1 formultiple-productandmultiple-marketmodelwithcommonality. Figure1.Generalizedmulti-productmulti-marketnetworkdesign. Thisstudydealtwith thestrategic facility locationdecisionofengineproductionbytaking into account thefinancialanddemandfeatures. Thenewsvendornetworkapproach isusedtoevaluate themodel. Firstly, we analyze the scenario under deterministic demand. The sensitivity of the trade-off between themanufacturing costs and the transportation costs are examined. Secondly, thesituationunderdemanduncertainty isevaluated.Here,weassumeuniformlydistributeddemand. Theprofit function is accordingly formulated and similar analysis is carried out. The function is solvedusingFrankWolfe’s sequential linearizationtechniquewithBender’sDecompositionmethod. Thirdly, theresultsofoptimaldecisionscenario iscomparedwith thescenarioofboundedrationality consideringuniformlydistributeddemand.Whenweconsider theboundedrationality, thebestoption isnotalwayspickedbyindividuals,however, theyopt forbetteroptionsoften. Finally,we intendto giveastatisticalproofof the superiorityof thealgorithmusedover the traditionalgradient search 131
back to the  book Algorithms for Scheduling Problems"
Algorithms for Scheduling Problems
Title
Algorithms for Scheduling Problems
Authors
Frank Werner
Larysa Burtseva
Yuri Sotskov
Editor
MDPI
Location
Basel
Date
2018
Language
English
License
CC BY 4.0
ISBN
978-3-03897-120-7
Size
17.0 x 24.4 cm
Pages
212
Keywords
Scheduling Problems in Logistics, Transport, Timetabling, Sports, Healthcare, Engineering, Energy Management
Categories
Informatik
Technik
Web-Books
Library
Privacy
Imprint
Austria-Forum
Austria-Forum
Web-Books
Algorithms for Scheduling Problems