•  Persian
    • Persian
    • English
  •   ورود
  • دانشگاه فردوسی مشهد
  • |
  • مرکز اطلاع‌رسانی و کتابخانه مرکزی
    • Persian
    • English
  • خانه
  • انواع منابع
    • مقاله مجله
    • کتاب الکترونیکی
    • مقاله همایش
    • استاندارد
    • پروتکل
    • پایان‌نامه
  • راهنمای استفاده
Search 
  •   کتابخانه دیجیتال دانشگاه فردوسی مشهد
  • Search
  •   کتابخانه دیجیتال دانشگاه فردوسی مشهد
  • Search
  • همه
  • عنوان
  • نویسنده
  • سال
  • ناشر
  • موضوع
  • عنوان ناشر
  • ISSN
  • شناسه الکترونیک
  • شابک
جستجوی پیشرفته
JavaScript is disabled for your browser. Some features of this site may not work without it.

Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

نمایش تعداد 1-10 از 271

    • Relevance
    • Title Asc
    • Title Desc
    • سال صعودی
    • سال نزولی
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
  • خروجی
    • CSV
    • RIS
    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100

    Combining Exact and Heuristic Approaches for the Covering Salesman Problem 

    نوع: Conference Paper
    نویسنده : مجید سالاری; زهرا ناجی عظیمی; Majid Salari; Zahra Naji Azimi
    سال: 2012
    خلاصه:

    and heuristic approach which takes advantage of Integer Linear Programming (ILP) techniques and heuristic search to improve the quality of the solutions. Extensive computational tests on the standard benchmark instances and on a new set of large sized...

    ILP-based improvement procedure for solving two variants of the standard vehicle routing problem 

    نوع: Conference Paper
    نویسنده : مجید سالاری; زهرا ناجی عظیمی; Paolo Toth; Andrea Tramontani; Majid Salari; Zahra Naji Azimi
    سال: 2014
    خلاصه:

    We develop an integer linear programming technique for solving two variants of the standard vehicle routing problem. Given an initial feasible solution to be possibly improved, the method follows a destruct-and-repair paradigm, where the given...

    An Integer Linear Programming based Heuristic for the Capacitated m-Ring-Star Problem 

    نوع: Journal Paper
    نویسنده : زهرا ناجی عظیمی; مجید سالاری; Paolo Toth; Zahra Naji Azimi; Majid Salari
    سال: 2012
    خلاصه:

    Variable Neighborhood Search scheme, the algorithm incorporates an Integer Linear Programming based improvement method which is applied whenever the heuristic algorithm is not able to improve the quality of the current solution. Extensive computational...

    Memetic and scatter search metaheuristic algorithms for a multiobjective fortnightly university course timetabling problem: a case study 

    نوع: Journal Paper
    نویسنده : نسیبه موحدفر; محمد رنجبر; مجید سالاری; سلیم رستمی; nasibeh movahhedfar; Mohammad Ranjbar; Majid Salari; Salim Rostami
    سال: 2013
    خلاصه:

    , four objectives should be optimized where we used the Lp-metric method to aggregate them into a single objective. An integer linear programming model and two metaheuristic algorithms, i.e. memetic and scatter search, have been developed for the studied...

    An ILP Improvement Procedure for the Open Vehicle Routing Problem 

    نوع: Journal Paper
    نویسنده : مجید سالاری; Andrea Tramontani; Paolo Toth; Majid Salari
    سال: 2010
    خلاصه:

    . We present a heuristic improvement procedure for OVRP based on Integer Linear Programming (ILP) techniques. Given an initial feasible solution

    to be possibly improved, the method follows a destruct-and-repair paradigm, where the given solution...

    An Integer Linear Programming based heuristic approach for the capacitated m-ring-star problem 

    نوع: Conference Paper
    نویسنده : مجید سالاری; زهرا ناجی عظیمی; Paolo Toth; Majid Salari; Zahra Naji Azimi
    سال: 2011
    خلاصه:

    of the Variable Neighborhood Search approach, the algorithm incorporates an Integer Linear Programming based improvement method which is applied whenever the heuristic procedure is not able to enhance the quality of the current solution. Extensive computational...

    Fortnightly course scheduling problem: a case study 

    نوع: Conference Paper
    نویسنده : محمد رنجبر; سلیم رستمی; Mohammad Ranjbar; Salim Rostami
    سال: 2012
    خلاصه:

    This paper studies a fortnightly university course timetabling problem. In this research, the Industrial Engineering Department of Ferdowsi University of Mashhad (Iran) is considered as the case study for investigation. An integer linear programming...

    Obtaining feasible solution and optimal load shedding in contingency - constrained unit commitment joint with reserve auction 

    نوع: Conference Paper
    نویسنده : مرتضی بیگدلی; علی کریم پور; Morteza Bigdeli; Ali Karimpour
    سال: 2014
    خلاصه:

    Integer Linear Programming (MILP) is used to minimize the total energy dispatch cost in 24 hours of a day. Numerical examples show that the proposed joint auction model can clear energy and ancillary services bids simultaneously while minimizing the total...

    Optimal constrained power scheduling in Electricity market 

    نوع: Conference Paper
    نویسنده : نادیا زنده دل; علی کریم پور; Ali Karimpour
    سال: 2008
    خلاصه:

    Optimal constrained power scheduling in Electricity market

    : Operating room scheduling under hybrid demand 

    نوع: Conference Paper
    نویسنده : امیررضا شجاعی فرد; بابک رضائی خبوشان; Hamed Yarmand; Amirreza Shojaeifard; Babak Rezaee Khabooshan
    سال: 2016
    خلاصه:

    including fixed cost and overtime cost). We develop an integer linear programming model for this scheduling problem. The developed model is a four dimensional assignment problem that determines the weekly schedule (day, surgeon, operating room, and type...

    • 1
    • 2
    • 3
    • 4
    • . . .
    • 28

    نویسنده

    ... View More

    ناشر

    سال

    کلیدواژه

    ... View More

    نوع

    زبان

    نوع محتوا

    عنوان ناشر

    ... View More
    • درباره ما
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    DSpace software copyright © 2019-2022  DuraSpace