+1-415-315-9853

info@mywordsolution.com

## Computer Science

 Algorithms Design Computer Network & Security Automata & Computation Operating System Computer Architecture Information Technology Internet Programming Software Engineering Data Communication Computer Graphics Compiler Design LINUX/UNIX Data Structure WINDOWS Application Digital Circuit E-Commerce Microprocessor Artificial Intelligence Data Warehouse Cryptography

Modify the heuristics for the 1-BP problem for the case where each bin j, j = 1,...,n, has a capacity qj and a cost fj. Apply the modified version of the BFD heuristic to the following problem. Brocard is a road carrier mainly operating in France and Benelux.

The vehicle fleet is composed of 14 vans of capacity equal to 800 kilograms and 22 vans of capacity equal to 500 kilograms. The company has to deliver 34 parcels of different sizes from Paris to Frankfurt (the distance between these cities is 592 kilometres). The characteristics of the parcels are reported in Table.

As only five company-owned vans (all having a capacity of 800 kilograms) will be available on the day of the delivery, Brocard has decided to hire additional vehicles from a third-party company. The following additional vehicles will be available:

• two trucks with a capacity of three tons each, whose hiring total cost (inclusive of drivers) is € 1.4 per kilometre;

• one truck with trailer, with a capacity of 3.5 tons, whose hiring total cost (inclusive of drivers) is € 1.6 per kilometre.

Which trucks should Brocard hire?

 Table : List of the parcels to be loaded and corresponding weight (in kilograms) in the Brocard problem. Parcel Weight Parcel Weight 1 228 18 170 2 228 19 170 3 228 20 170 4 217 21 170 5 217 22 95 6 217 23 95 7 217 24 95 8 210 25 95 9 210 26 75 10 210 27 75 11 210 28 75 12 195 29 75 13 195 30 75 14 195 31 75 15 170 32 55 16 170 33 55 17 170 34 55

Automata & Computation, Computer Science

• Category:- Automata & Computation
• Reference No.:- M92070785

Have any Question?

## Related Questions in Automata & Computation

### Construct unambiguous context-free grammars for each of the

Construct unambiguous context-free grammars for each of the following languages. In each case show that your grammar is correct. a) Arithmetic expressions in postfix notation b) Right - associative lists of identifiers s ...

### A show that all binary strings generated by the following

a) Show that all binary strings generated by the following grammar have values divisible by 3. Hint. Use induction on the number of nodes in a parse tree. num -> 11 | 1001 | num 0 | num num b) Does the grammar generate a ...

### 1 extend the cpl model to the case of demand varying over

1. Extend the CPL model to the case of demand varying over the planning horizon. Assume that, once opened, a facility cannot be closed. 2. Consider the following CPL formulation: |V 1 | = 3, |V 2 | = 7, f = [44, 46, 21] ...

### Tankless microwave water heating systems have been

Tankless microwave water heating systems have been introduced that not only quickly provide hot water but also significantly reduce the exergy destruction inherent in domestic water heating with conventional electrical a ...

### Construct a syntax-directed translation scheme that

Construct a syntax-directed translation scheme that trans-lates arithmetic expressions from infix notation into prefix notation in which an operator appears before its operands; e.g., -xy is the prefix notation for x -y. ...

### Qestion 1 consider the following language llambda ltmgt

Question 1) Consider the following language L λ = { | M does NOT accept the empty string λ}. Prove that this language is not RE. You MUST do this via a reduction using L nd . That is, show that if there exists an accepti ...

### The following is an ambiguous grammarconstruct for this

The following is an ambiguous grammar: Construct for this grammar its collection of sets of LR(0) items. If we try to build an LR-parsing table for the grammar, there are certain conicting actions. What are they? Suppose ...

### Consider the context-free grammars -gt ss ss aa give a

Consider the context-free grammar: S -> SS + |SS*| a a) Give a leftmost derivation for the string. b) Give a rightmost derivation for the string. c) Give a parse tree for the string. ! d) Is the grammar ambiguous or unam ...

### Modify the heuristics for the 1-bp problem for the case

Modify the heuristics for the 1-BP problem for the case where each bin j, j = 1,...,n, has a capacity qj and a cost f j . Apply the modified version of the BFD heuristic to the following problem. Brocard is a road carrie ...

### 1 show that if there are no operational constraints there

1. Show that, if there are no operational constraints, there always exists an optimal NRP solution in which a single vehicle is used (hint: least-cost path costs satisfy the triangle inequality). 2. Show that if the cost ...

• 13,132 Experts

## Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

### Section onea in an atwood machine suppose two objects of

SECTION ONE (a) In an Atwood Machine, suppose two objects of unequal mass are hung vertically over a frictionless

### Part 1you work in hr for a company that operates a factory

Part 1: You work in HR for a company that operates a factory manufacturing fiberglass. There are several hundred empl

### Details on advanced accounting paperthis paper is intended

DETAILS ON ADVANCED ACCOUNTING PAPER This paper is intended for students to apply the theoretical knowledge around ac

### Create a provider database and related reports and queries

Create a provider database and related reports and queries to capture contact information for potential PC component pro

### Describe what you learned about the impact of economic

Describe what you learned about the impact of economic, social, and demographic trends affecting the US labor environmen