Web-Books
im Austria-Forum
Austria-Forum
Web-Books
Informatik
Algorithms for Scheduling Problems
Seite - 131 -
  • Benutzer
  • Version
    • Vollversion
    • Textversion
  • Sprache
    • Deutsch
    • English - Englisch

Seite - 131 - in Algorithms for Scheduling Problems

Bild der Seite - 131 -

Bild der Seite - 131 - in Algorithms for Scheduling Problems

Text der Seite - 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
zurück zum  Buch Algorithms for Scheduling Problems"
Algorithms for Scheduling Problems
Titel
Algorithms for Scheduling Problems
Autoren
Frank Werner
Larysa Burtseva
Yuri Sotskov
Herausgeber
MDPI
Ort
Basel
Datum
2018
Sprache
englisch
Lizenz
CC BY 4.0
ISBN
978-3-03897-120-7
Abmessungen
17.0 x 24.4 cm
Seiten
212
Schlagwörter
Scheduling Problems in Logistics, Transport, Timetabling, Sports, Healthcare, Engineering, Energy Management
Kategorien
Informatik
Technik
Web-Books
Bibliothek
Datenschutz
Impressum
Austria-Forum
Austria-Forum
Web-Books
Algorithms for Scheduling Problems